hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-10 11:09:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update README.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2018-04-26 07:39:08 +03:00
parent 55234b38b7
commit 351f612af9
1 changed files with 19 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
README.md
View File

@ -25,6 +25,8 @@
## Algorithms ## Algorithms
### Algorithms by Topic
* **Math** * **Math**
* [Factorial](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/factorial) * [Factorial](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/factorial)
* [Fibonacci Number](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/fibonacci) * [Fibonacci Number](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/fibonacci)
@ -70,21 +72,27 @@
* **Minimum Spanning Tree** * **Minimum Spanning Tree**
* Prim’s algorithm * Prim’s algorithm
* Kruskal’s algorithm * Kruskal’s algorithm
* **Dynamic Programming**
* [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/string/longest-common-subsequnce) (LCS)
* [Longest Common Substring](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/longest-common-substring)
* Increasing subsequence
* Knapsack problem
* Maximum subarray
* Maximum sum path
* Integer Partition
* Longest Increasing subsequence
* Shortest common supersequence
* **Uncategorized** * **Uncategorized**
* Union-Find * Union-Find
* Maze * Maze
### Algorithms by Paradigm
* **Greedy**
* **Divide and Conquer**
* **Dynamic Programming**
* [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/string/longest-common-subsequnce) (LCS)
* [Longest Common Substring](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/longest-common-substring)
* Increasing subsequence
* Longest Increasing subsequence
* Shortest common supersequence
* Knapsack problem
* Maximum subarray
* Maximum sum path
* Integer Partition
* **Backtracking**
* **Branch & Bound**
## Running Tests ## Running Tests