Update README.md

This commit is contained in:
Heqin Zhu 2020-04-24 14:01:32 +08:00 committed by GitHub
parent 8aa081ba67
commit 88a1488bac
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

View File

@ -9,11 +9,24 @@
[![codebeat badge](https://codebeat.co/badges/d52dd17d-a437-4dee-a6ec-cb532e8135bd)](https://codebeat.co/projects/github-com-mbinary-algorithm-master)
>Notes and codes for learning algorithm and data structures :smiley:
Some pictures and ideas are from `<<Introduction to Algotithm>>`
[Here](https://mbinary.github.io/algorithm) is the notes in Chinese.
# Index
## Notes
>Notes were written in Chinese. Some pictures and ideas are from `Introduction to Algotithm`
* docs
* [algorithm-general.md](./docs/algorithm-general.md)
* [b-tree.md](./docs/b-tree.md)
* [dft.md](./docs/dft.md)
* [fib-heap.md](./docs/fib-heap.md)
* [graph.md](./docs/graph.md)
* [hashTable.md](./docs/hashTable.md)
* [red-black-tree.md](./docs/red-black-tree.md)
* [sort.md](./docs/sort.md)
* [string-matching.md](./docs/string-matching.md)
* [tree.md](./docs/tree.md)
## Codes
* [.](.)
* [LICENSE](./LICENSE)
* [README.md](./README.md)
@ -41,20 +54,6 @@ Some pictures and ideas are from `<<Introduction to Algotithm>>`
* [winnerTree.py](./dataStructure/winnerTree.py)
* [divideAndConquer](./divideAndConquer)
* [min_distance_of_n_points.py](./divideAndConquer/min_distance_of_n_points.py)
* [docs](./docs)
* [README.md](./docs/README.md)
* [_config.yml](./docs/_config.yml)
* [algorithm-general.md](./docs/algorithm-general.md)
* [b-tree.md](./docs/b-tree.md)
* [dft.md](./docs/dft.md)
* [fib-heap.md](./docs/fib-heap.md)
* [graph.md](./docs/graph.md)
* [hashTable.md](./docs/hashTable.md)
* [red-black-tree.md](./docs/red-black-tree.md)
* [sort.md](./docs/sort.md)
* [src](./docs/src)
* [string-matching.md](./docs/string-matching.md)
* [tree.md](./docs/tree.md)
* [dynamicProgramming](./dynamicProgramming)
* [Vec2d.hs](./dynamicProgramming/Vec2d.hs)
* [last-stone-weight.py](./dynamicProgramming/last-stone-weight.py)