fixed typo (TheAlgorithms#1363)

nikhil18440 · gamingwithnickYT · web-flow · commit 9757e2bee33f · 2023-09-19T16:40:32.000+05:30
Co-authored-by: unknown &lt;nickjr@gmail.com&gt;
diff --git a/Backtracking/AllCombinationsOfSizeK.js b/Backtracking/AllCombinationsOfSizeK.js
@@ -2,7 +2,7 @@
   Problem: Given two numbers, n and k, make all unique combinations of k numbers from 1 to n and in sorted order
 
   What is combinations?
-  - Combinations is selecting items from a collections without considering order of selection
+  - Combinations is selecting items from a collections without considering the order of selection
 
   Example:
   - We have an apple, a banana, and a jackfruit
diff --git a/Data-Structures/Array/LocalMaximomPoint.js b/Data-Structures/Array/LocalMaximomPoint.js
@@ -3,7 +3,7 @@
  *
  * Notes:
  * - works by using divide and conquer
- * - the function gets the array A with n Real numbers and returns the local max point index (if more than one exists return the first one)
+ * - the function gets the array A with n Real numbers and returns the index of local max point (if more than one exists return the first one)
  *
  * @complexity: O(log(n)) (on average )
  * @complexity: O(log(n)) (worst case)
diff --git a/Data-Structures/Graph/Graph2.js b/Data-Structures/Graph/Graph2.js
@@ -42,7 +42,7 @@ class Graph {
 
     // iterate over the vertices
     for (const i of getKeys) {
-      // great the corresponding adjacency list
+      // get the corresponding adjacency list
       // for the vertex
       const getValues = this.AdjList.get(i)
       let conc = ''

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@`
`3`	`3`	`*`
`4`	`4`	`* Notes:`
`5`	`5`	`* - works by using divide and conquer`
`6`		`- * - the function gets the array A with n Real numbers and returns the local max point index (if more than one exists return the first one)`
	`6`	`+ * - the function gets the array A with n Real numbers and returns the index of local max point (if more than one exists return the first one)`
`7`	`7`	`*`
`8`	`8`	`* @complexity: O(log(n)) (on average )`
`9`	`9`	`* @complexity: O(log(n)) (worst case)`