Visualization and Audibilization of algorithms.
 xudafeng |
|---|
This project follows the git-contributor spec, auto updated at Mon Aug 19 2019 10:30:56 GMT+0800.
| Sorting algorithms | Time complexity | Space complexity | Stability |
|---|---|---|---|
| Bubble sort | O(n^2) | O(1) | yes |
| Bucket sort | O(n+k) | O(n*k) | yes |
| Heap sort | O(nlogn) | O(1) | no |
| Insertion sort | O(n^2) | O(1) | yes |
| Merge sort | O(nlogn) | O(n) | yes |
| Quick sort | O(nlogn) | O(1) | no |
| Selection sort | O(n^2) | O(1) | no |
| Shell sort | O(nlog^2n) | O(1) | no |
| Bogo sort | O(n·n!)[∞] | O(n) | yes |
Time complexity(Average)
Space complexity(Auxiliary)
- Minimum Cost Spanning Tree
- Prim
- Kruskal
- Shortest Paths Problem
- Dijkstra
- Topological Sort
- Astar demo
- Data mining
- Cluster Analysis
- Decision Tree
- Artificial Neural Network
- Naive Bayes classifier
- k-Nearest Neighbor
- Image Transformation
$ npm i
$ npm run testMIT Licensed.