mirror of
https://github.com/heqin-zhu/algorithm.git
synced 2024-03-22 13:30:46 +08:00
114 lines
5.2 KiB
Markdown
114 lines
5.2 KiB
Markdown
|
|
# Algorithm and data structures
|
|
|
|
[![Stars](https://img.shields.io/github/stars/mbinary/algorithm.svg?label=Stars&style=social)](https://github.com/mbinary/algorithm/stargazers)
|
|
[![Forks](https://img.shields.io/github/forks/mbinary/algorithm.svg?label=Fork&style=social)](https://github.com/mbinary/algorithm/network/members)
|
|
[![repo-size](https://img.shields.io/github/repo-size/mbinary/algorithm.svg)]()
|
|
[![License](https://img.shields.io/badge/LICENSE-WTFPL-blue.svg)](LICENSE)
|
|
[![Language](https://img.shields.io/badge/language-python3-orange.svg)]()
|
|
[![codebeat badge](https://codebeat.co/badges/4ef725b5-405a-4390-a860-a86deefab3f8)](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>>`
|
|
|
|
# Notes
|
|
* [docs](./docs)
|
|
* [algorithm-general.md](./docs/algorithm-general.md)
|
|
* [b-tree.md](./docs/b-tree.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)
|
|
|
|
# Index
|
|
* [.](.)
|
|
* [LICENSE](./LICENSE)
|
|
* [README.md](./README.md)
|
|
* [_config.yml](./_config.yml)
|
|
* [backtracking](./backtracking)
|
|
* [dataStructure](./dataStructure)
|
|
* [allOone](./dataStructure/allOone)
|
|
* [bTree.py](./dataStructure/bTree.py)
|
|
* [binaryHeap.py](./dataStructure/binaryHeap.py)
|
|
* [binaryHeap1.py](./dataStructure/binaryHeap1.py)
|
|
* [binaryTree.py](./dataStructure/binaryTree.py)
|
|
* [circularQueue.py](./dataStructure/circularQueue.py)
|
|
* [graph](./dataStructure/graph)
|
|
* [hashTable.py](./dataStructure/hashTable.py)
|
|
* [huffman](./dataStructure/huffman)
|
|
* [intervalTree.py](./dataStructure/intervalTree.py)
|
|
* [leftHeap.py](./dataStructure/leftHeap.py)
|
|
* [linkedList.py](./dataStructure/linkedList.py)
|
|
* [loserTree.py](./dataStructure/loserTree.py)
|
|
* [map.cc](./dataStructure/map.cc)
|
|
* [polynomial.cpp](./dataStructure/polynomial.cpp)
|
|
* [polynomial.py](./dataStructure/polynomial.py)
|
|
* [redBlackTree.py](./dataStructure/redBlackTree.py)
|
|
* [redBlackTree0.py](./dataStructure/redBlackTree0.py)
|
|
* [splayTree.py](./dataStructure/splayTree.py)
|
|
* [trie](./dataStructure/trie)
|
|
* [unionFindSet](./dataStructure/unionFindSet)
|
|
* [winnerTree.py](./dataStructure/winnerTree.py)
|
|
* [divideAndConquer](./divideAndConquer)
|
|
* [min_distance_of_n_points.py](./divideAndConquer/min_distance_of_n_points.py)
|
|
* [dynamicProgramming](./dynamicProgramming)
|
|
* [Vec2d.hs](./dynamicProgramming/Vec2d.hs)
|
|
* [lcs.py](./dynamicProgramming/lcs.py)
|
|
* [matrixChainMultiply.py](./dynamicProgramming/matrixChainMultiply.py)
|
|
* [splitStripe.hs](./dynamicProgramming/splitStripe.hs)
|
|
* [splitStripe.py](./dynamicProgramming/splitStripe.py)
|
|
* [stoneGame.py](./dynamicProgramming/stoneGame.py)
|
|
* [testVec2d.hs](./dynamicProgramming/testVec2d.hs)
|
|
* [wildcard_matching.py](./dynamicProgramming/wildcard_matching.py)
|
|
* [graph](./graph)
|
|
* [cloneGraph.cpp](./graph/cloneGraph.cpp)
|
|
* [isBipartGraph.py](./graph/isBipartGraph.py)
|
|
* [math](./math)
|
|
* [README.md](./math/README.md)
|
|
* [convertWeight.py](./math/convertWeight.py)
|
|
* [fastPow.py](./math/fastPow.py)
|
|
* [fibonacci](./math/fibonacci)
|
|
* [numberTheory](./math/numberTheory)
|
|
* [numericalAnalysis](./math/numericalAnalysis)
|
|
* [permute](./math/permute)
|
|
* [parser](./parser)
|
|
* [PL0-compiler](./parser/PL0-compiler)
|
|
* [calculator](./parser/calculator)
|
|
* [declarationParser](./parser/declarationParser)
|
|
* [search](./search)
|
|
* [8Astar.py](./search/8Astar.py)
|
|
* [BFS_knight.hs](./search/BFS_knight.hs)
|
|
* [binary_search.hs](./search/binary_search.hs)
|
|
* [bloomFilter.py](./search/bloomFilter.py)
|
|
* [schedule.py](./search/schedule.py)
|
|
* [work_dispatch.py](./search/work_dispatch.py)
|
|
* [sort](./sort)
|
|
* [binaryTree.py](./sort/binaryTree.py)
|
|
* [heapSort.py](./sort/heapSort.py)
|
|
* [quickSort.c](./sort/quickSort.c)
|
|
* [quickSort.py](./sort/quickSort.py)
|
|
* [radixSort.py](./sort/radixSort.py)
|
|
* [select.py](./sort/select.py)
|
|
* [shellSort.py](./sort/shellSort.py)
|
|
* [string](./string)
|
|
* [KMP.py](./string/KMP.py)
|
|
* [README.md](./string/README.md)
|
|
* [manacher.py](./string/manacher.py)
|
|
* [markov.py](./string/markov.py)
|
|
* [rabin_karp.py](./string/rabin_karp.py)
|
|
* [rotate.py](./string/rotate.py)
|
|
* [src](./string/src)
|
|
* [sunday.py](./string/sunday.py)
|
|
* [wildcard_matching.py](./string/wildcard_matching.py)
|
|
* [utils](./utils)
|
|
* [codecogs.py](./utils/codecogs.py)
|
|
* [config.py](./utils/config.py)
|
|
* [genReadme.py](./utils/genReadme.py)
|
|
* [headinfo.py](./utils/headinfo.py)
|
|
* [tree.py](./utils/tree.py)
|