Merge pull request #1 from trekhleb/master

Pull from trekhleb/javascript-algorithms

Author: aalhour

CONTRIBUTING.md

@@ -3,3 +3,4 @@
 - As much as possible, try to follow the existing format of markdown and code.
 - Don't forget to run `npm run lint` and `npm test` before submitting pull requests.
 - Make sure that **100%** of your code is covered by tests.
+- If you're adding **new** algorithms or data structures please provide **README.md** for each of them **with explanations** of the algorithm and **with links** to further readings.

README.md

@@ -6,15 +6,17 @@
 This repository contains JavaScript based examples of many 
 popular algorithms and data structures.
 
-Each algorithm and data structure have its own separate README 
-with related explanations and links for further reading and YouTube
-videos.
+Each algorithm and data structure has its own separate README
+with related explanations and links for further reading (including ones
+to YouTube videos).
 
-_Read this in other languages:_ [简体中文](https://github.com/trekhleb/javascript-algorithms/blob/master/README.zh-CN.md)
+_Read this in other languages:_ 
+[简体中文](https://github.com/trekhleb/javascript-algorithms/blob/master/README.zh-CN.md),
+[繁體中文](https://github.com/trekhleb/javascript-algorithms/blob/master/README.zh-TW.md)
 
 ## Data Structures
 
-Data structure is a particular way of organizing and storing data in a computer so that it can 
+A data structure is a particular way of organizing and storing data in a computer so that it can
 be accessed and modified efficiently. More precisely, a data structure is a collection of data 
 values, the relationships among them, and the functions or operations that can be applied to 
 the data.
@@ -29,17 +31,14 @@ the data.
 * [Tree](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree)
     * [Binary Search Tree](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/binary-search-tree)
     * [AVL Tree](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/avl-tree)
-    * Red-Black Tree
-    * Suffix Tree
-    * Segment Tree or Interval Tree
-    * Binary Indexed Tree or Fenwick Tree
+    * [Red-Black Tree](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/red-black-tree)
 * [Graph](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/graph) (both directed and undirected)
 * [Disjoint Set](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/disjoint-set)
 
 ## Algorithms
 
-Algorithm is an unambiguous specification of how to solve a class of problems. Algorithm is
-a set of rules that precisely defines a sequence of operations.
+An algorithm is an unambiguous specification of how to solve a class of problems. It is
+a set of rules that precisely define a sequence of operations.
 
 ### Algorithms by Topic
 
@@ -52,7 +51,7 @@ a set of rules that precisely defines a sequence of operations.
   * [Integer Partition](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/integer-partition)
 * **Sets**
   * [Cartesian Product](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/cartesian-product) - product of multiple sets
-  * [Power Set](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/power-set) - all subsets of the set 
+  * [Power Set](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/power-set) - all subsets of a set
   * [Permutations](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/permutations) (with and without repetitions)
   * [Combinations](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/combinations) (with and without repetitions)
   * [Fisher–Yates Shuffle](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/fisher-yates) - random permutation of a finite sequence
@@ -61,26 +60,29 @@ a set of rules that precisely defines a sequence of operations.
   * [Shortest Common Supersequence](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/shortest-common-supersequence) (SCS)
   * [Knapsack Problem](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/knapsack-problem) - "0/1" and "Unbound" ones
   * [Maximum Subarray](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/maximum-subarray) - "Brute Force" and "Dynamic Programming" (Kadane's) versions
-* **String**
+* **Strings**
   * [Levenshtein Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences
   * [Hamming Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/hamming-distance) - number of positions at which the symbols are different
   * [Knuth–Morris–Pratt Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/knuth-morris-pratt) - substring search
   * [Rabin Karp Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/rabin-karp) - substring search
   * [Longest Common Substring](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/longest-common-substring)
-* **Search**
+* **Searches**
+  * [Linear Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/search/linear-search)
   * [Binary Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/search/binary-search)
 * **Sorting**
   * [Bubble Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/bubble-sort)
   * [Selection Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/selection-sort)
   * [Insertion Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/insertion-sort)
   * [Heap Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/heap-sort)
   * [Merge Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/merge-sort)
-  * [Quicksort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/quick-sort)
+  * [Quicksort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/quick-sort) - in-place and non-in-place implementations
   * [Shellsort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/shell-sort)
-* **Tree**  
+  * [Counting Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/counting-sort)
+  * [Radix Sort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/radix-sort)
+* **Trees**
   * [Depth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/tree/depth-first-search) (DFS)
   * [Breadth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/tree/breadth-first-search) (BFS)
-* **Graph**
+* **Graphs**
   * [Depth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/depth-first-search) (DFS)
   * [Breadth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/breadth-first-search) (BFS)
   * [Dijkstra Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/dijkstra) - finding shortest path to all graph vertices
@@ -124,7 +126,7 @@ algorithm is an abstraction higher than a computer program.
   * [Quicksort](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sorting/quick-sort)
   * [Tree Depth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/tree/depth-first-search) (DFS)
   * [Graph Depth-First Search](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/depth-first-search) (DFS)
-* **Dynamic Programming** - build up to a solution using previously found sub-solutions
+* **Dynamic Programming** - build up a solution using previously found sub-solutions
   * [Fibonacci Number](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/fibonacci)
   * [Levenshtein Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences
   * [Longest Common Subsequence](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/longest-common-subsequnce) (LCS)
@@ -135,9 +137,9 @@ algorithm is an abstraction higher than a computer program.
   * [Integer Partition](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/integer-partition)
   * [Maximum Subarray](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/maximum-subarray)
   * [Bellman-Ford Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/bellman-ford) - finding shortest path to all graph vertices
-* **Backtracking** - similarly to brute force try to generate all possible solutions but each time you generate a solution test 
-if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise backtrack and go on a 
-different path of finding solution
+* **Backtracking** - similarly to brute force, try to generate all possible solutions, but each time you generate a solution test
+if it satisfies all conditions, and only then continue generating subsequent solutions. Otherwise, backtrack, and go on a 
+different path of finding a solution
   * [Hamiltonian Cycle](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/hamiltonian-cycle) - Visit every vertex exactly once
   * [N-Queens Problem](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/uncategorized/n-queens)
   * [Knight's Tour](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/uncategorized/knight-tour)
@@ -213,12 +215,14 @@ Below is the list of some of the most used Big O notations and their performance
 
 ### Array Sorting Algorithms Complexity
 
-| Name                  | Best      | Average   | Worst         | Memory    | Stable    |
-| --------------------- | :-------: | :-------: | :-----------: | :-------: | :-------: |
-| **Bubble sort**       | n         | n^2       | n^2           | 1         | Yes       |
-| **Insertion sort**    | n         | n^2       | n^2           | 1         | Yes       |
-| **Selection sort**    | n^2       | n^2       | n^2           | 1         | No        |
-| **Heap sort**         | n log(n)  | n log(n)  | n log(n)      | 1         | No        |
-| **Merge sort**        | n log(n)  | n log(n)  | n log(n)      | n         | Yes       |
-| **Quick sort**        | n log(n)  | n log(n)  | n^2           | log(n)    | No        |
-| **Shell sort**        | n log(n)  | depends on gap sequence   | n (log(n))^2  | 1         | No        |
+| Name                  | Best      | Average   | Worst         | Memory    | Stable    | Comments  |
+| --------------------- | :-------: | :-------: | :-----------: | :-------: | :-------: | :-------- |
+| **Bubble sort**       | n         | n^2       | n^2           | 1         | Yes       |           |
+| **Insertion sort**    | n         | n^2       | n^2           | 1         | Yes       |           |
+| **Selection sort**    | n^2       | n^2       | n^2           | 1         | No        |           |
+| **Heap sort**         | n log(n)  | n log(n)  | n log(n)      | 1         | No        |           |
+| **Merge sort**        | n log(n)  | n log(n)  | n log(n)      | n         | Yes       |           |
+| **Quick sort**        | n log(n)  | n log(n)  | n^2           | log(n)    | No        |           |
+| **Shell sort**        | n log(n)  | depends on gap sequence   | n (log(n))^2  | 1         | No        |           |
+| **Counting sort**     | n + r     | n + r     | n + r         | n + r     | Yes       | r - biggest number in array |
+| **Radix sort**        | n * k     | n * k     | n * k         | n + k    | Yes        | k - length of longest key |

README.zh-CN.md

@@ -7,7 +7,9 @@
 
 每种算法和数据结构都有自己的 README 并提供相关说明以及进一步阅读和 YouTube 视频。
 
-_Read this in other languages:_ [_English_](https://github.com/trekhleb/javascript-algorithms/)
+_Read this in other languages:_
+[_English_](https://github.com/trekhleb/javascript-algorithms/),
+[繁體中文](https://github.com/trekhleb/javascript-algorithms/blob/master/README.zh-TW.md)
 
 ## 数据结构
 
@@ -23,10 +25,7 @@ _Read this in other languages:_ [_English_](https://github.com/trekhleb/javascri
 * [树](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree)
     * [二分查找](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/binary-search-tree)
     * [AVL 树](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/avl-tree)
-    * 红黑树
-    * 后缀树
-    * 线段树 或 间隔树
-    * 二叉索引树
+    * [红黑树](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/tree/red-black-tree)
 * [图](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/graph) (有向图与无向图)
 * [并查集](https://github.com/trekhleb/javascript-algorithms/tree/master/src/data-structures/disjoint-set)