hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-12-27 07:31:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update README.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2018-05-19 23:20:20 +03:00
parent 64552d16f3
commit 296b20ed16
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
README.md
View File

@ -104,6 +104,7 @@ of algorithms. It is an abstraction higher than the notion of an algorithm, just
algorithm is an abstraction higher than a computer program. algorithm is an abstraction higher than a computer program.
* **Brute Force** - look at all the possibilities and selects the best solution * **Brute Force** - look at all the possibilities and selects the best solution
* [Maximum Subarray](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/maximum-subarray)
* **Greedy** - choose the best option at the current time, without any consideration for the future * **Greedy** - choose the best option at the current time, without any consideration for the future
* [Unbound Knapsack Problem](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/knapsack-problem) * [Unbound Knapsack Problem](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/knapsack-problem)
* [Dijkstra Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/dijkstra) - finding shortest path to all graph vertices * [Dijkstra Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/graph/dijkstra) - finding shortest path to all graph vertices