Commit 53cd4fb

shlomiftrekhleb

authored and

committed

Correct some grammar in the README. (trekhleb#39)

1 parent 56ff37d commit 53cd4fbCopy full SHA for 53cd4fb

File tree

1 file changed

+14

-14

lines changed

README.md

1 file changed

+14

-14

lines changed

`‎README.md`

Lines changed: 14 additions & 14 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,17 +6,17 @@`
`6`	`6`	`This repository contains JavaScript based examples of many`
`7`	`7`	`popular algorithms and data structures.`
`8`	`8`
`9`		`-Each algorithm and data structure have its own separate README`
`10`		`-with related explanations and links for further reading and YouTube`
`11`		`-videos.`
	`9`	`+Each algorithm and data structure has its own separate README`
	`10`	`+with related explanations and links for further reading (including ones`
	`11`	`+to YouTube videos).`
`12`	`12`
`13`	`13`	`_Read this in other languages:_`
`14`	`14`	`[简体中文](https://github.com/trekhleb/javascript-algorithms/blob/master/README.zh-CN.md),`
`15`	`15`	`[繁體中文](https://github.com/trekhleb/javascript-algorithms/blob/master/README.zh-TW.md)`
`16`	`16`
`17`	`17`	`## Data Structures`
`18`	`18`
`19`		`-Data structure is a particular way of organizing and storing data in a computer so that it can`
	`19`	`+A data structure is a particular way of organizing and storing data in a computer so that it can`
`20`	`20`	`be accessed and modified efficiently. More precisely, a data structure is a collection of data`
`21`	`21`	`values, the relationships among them, and the functions or operations that can be applied to`
`22`	`22`	`the data.`
`@@ -37,8 +37,8 @@ the data.`
`37`	`37`
`38`	`38`	`## Algorithms`
`39`	`39`
`40`		`-Algorithm is an unambiguous specification of how to solve a class of problems. Algorithm is`
`41`		`-a set of rules that precisely defines a sequence of operations.`
	`40`	`+An algorithm is an unambiguous specification of how to solve a class of problems. It is`
	`41`	`+a set of rules that precisely define a sequence of operations.`
`42`	`42`
`43`	`43`	`### Algorithms by Topic`
`44`	`44`
`@@ -51,7 +51,7 @@ a set of rules that precisely defines a sequence of operations.`
`51`	`51`	`* [Integer Partition](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/integer-partition)`
`52`	`52`	`* Sets`
`53`	`53`	`* [Cartesian Product](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/cartesian-product) - product of multiple sets`
`54`		`- * [Power Set](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/power-set) - all subsets of the set`
	`54`	`+ * [Power Set](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/power-set) - all subsets of a set`
`55`	`55`	`* [Permutations](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/permutations) (with and without repetitions)`
`56`	`56`	`* [Combinations](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/combinations) (with and without repetitions)`
`57`	`57`	`* [Fisher–Yates Shuffle](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/fisher-yates) - random permutation of a finite sequence`
`@@ -60,13 +60,13 @@ a set of rules that precisely defines a sequence of operations.`
`60`	`60`	`* [Shortest Common Supersequence](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/shortest-common-supersequence) (SCS)`
`61`	`61`	`* [Knapsack Problem](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/knapsack-problem) - "0/1" and "Unbound" ones`
`62`	`62`	`* [Maximum Subarray](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/maximum-subarray) - "Brute Force" and "Dynamic Programming" (Kadane's) versions`
`63`		`-* String`
	`63`	`+* Strings`
`64`	`64`	`* [Levenshtein Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences`
`65`	`65`	`* [Hamming Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/hamming-distance) - number of positions at which the symbols are different`
`66`	`66`	`* [Knuth–Morris–Pratt Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/knuth-morris-pratt) - substring search`
`67`	`67`	`* [Rabin Karp Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/rabin-karp) - substring search`
`68`	`68`	`* [Longest Common Substring](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/longest-common-substring)`
`69`		`-* Search`
	`69`	`+* Searches`
`70`	`70`	`* [Linear Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/search/linear-search)`
`71`	`71`	`* [Binary Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/search/binary-search)`
`72`	`72`	`* Sorting`
`@@ -79,10 +79,10 @@ a set of rules that precisely defines a sequence of operations.`
`79`	`79`	`* [Shellsort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/shell-sort)`
`80`	`80`	`* [Counting Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/counting-sort)`
`81`	`81`	`* [Radix Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/radix-sort)`
`82`		`-* Tree`
	`82`	`+* Tree Searches`
`83`	`83`	`* [Depth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/tree/depth-first-search) (DFS)`
`84`	`84`	`* [Breadth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/tree/breadth-first-search) (BFS)`
`85`		`-* Graph`
	`85`	`+* Graph Algorithms`
`86`	`86`	`* [Depth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/depth-first-search) (DFS)`
`87`	`87`	`* [Breadth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/breadth-first-search) (BFS)`
`88`	`88`	`* [Dijkstra Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/dijkstra) - finding shortest path to all graph vertices`
`@@ -126,7 +126,7 @@ algorithm is an abstraction higher than a computer program.`
`126`	`126`	`* [Quicksort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/quick-sort)`
`127`	`127`	`* [Tree Depth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/tree/depth-first-search) (DFS)`
`128`	`128`	`* [Graph Depth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/depth-first-search) (DFS)`
`129`		`-* Dynamic Programming - build up to a solution using previously found sub-solutions`
	`129`	`+* Dynamic Programming - build up a solution using previously found sub-solutions`
`130`	`130`	`* [Fibonacci Number](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/fibonacci)`
`131`	`131`	`* [Levenshtein Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences`
`132`	`132`	`* [Longest Common Subsequence](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/longest-common-subsequnce) (LCS)`
`@@ -137,8 +137,8 @@ algorithm is an abstraction higher than a computer program.`
`137`	`137`	`* [Integer Partition](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/integer-partition)`
`138`	`138`	`* [Maximum Subarray](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/maximum-subarray)`
`139`	`139`	`* [Bellman-Ford Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/bellman-ford) - finding shortest path to all graph vertices`
`140`		`-* Backtracking - similarly to brute force try to generate all possible solutions but each time you generate a solution test`
`141`		`-if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise backtrack and go on a`
	`140`	`+* Backtracking - similarly to brute force, try to generate all possible solutions, but each time you generate a solution test`
	`141`	`+if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise, backtrack, and go on a`
`142`	`142`	`different path of finding solution`
`143`	`143`	`* [Hamiltonian Cycle](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/hamiltonian-cycle) - Visit every vertex exactly once`
`144`	`144`	`* [N-Queens Problem](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/uncategorized/n-queens)`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 53cd4fb

File tree

1 file changed

1 file changed

`‎README.md`

0 commit comments