mirror of
https://github.com/heqin-zhu/algorithm.git
synced 2024-03-22 13:30:46 +08:00
81 lines
3.7 KiB
Markdown
81 lines
3.7 KiB
Markdown
# Algorithm and Data Structures
|
|
>Notes and codes for learning algorithm and data structures :smiley:
|
|
|
|
Some pictures and ideas are from `<<Introduction to Algotithm>>
|
|
|
|
I use python 3.6+ and c++ to implements them.
|
|
Since I used f-Strings in python, you may use python 3.6+ to run the following python scripts.
|
|
|
|
>>I am still learning new things and this repo is always updating.
|
|
|
|
# Notice
|
|
Currently, Github can't render latex math formulas.
|
|
So,if you wannt to view the notes which contain latex math formulas and are in markdown format, you can visit [my blog](https://mbinary.coding.me)
|
|
|
|
# Index
|
|
* [.](.)
|
|
* [computationalMethod](./computationalMethod)
|
|
* [interplotion.py](./computationalMethod/interplotion.py)
|
|
* [iteration.py](./computationalMethod/iteration.py)
|
|
* [least_square.py](./computationalMethod/least_square.py)
|
|
* [linear_equation.py](./computationalMethod/linear_equation.py)
|
|
* [numerical_differential.py](./computationalMethod/numerical_differential.py)
|
|
* [numerical_integration.py](./computationalMethod/numerical_integration.py)
|
|
* [README.md](./computationalMethod/README.md)
|
|
* [solve-linear-by-iteration.py](./computationalMethod/solve-linear-by-iteration.py)
|
|
* [tongyu_equation.py](./computationalMethod/tongyu_equation.py)
|
|
* [vector_norm.py](./computationalMethod/vector_norm.py)
|
|
* [dataStructure](./dataStructure)
|
|
* [allOone](./dataStructure/allOone)
|
|
* [binaryHeap.py](./dataStructure/binaryHeap.py)
|
|
* [binaryTree.py](./dataStructure/binaryTree.py)
|
|
* [bTree.py](./dataStructure/bTree.py)
|
|
* [graph](./dataStructure/graph)
|
|
* [hashTable.py](./dataStructure/hashTable.py)
|
|
* [huffman](./dataStructure/huffman)
|
|
* [leftHeap.py](./dataStructure/leftHeap.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)
|
|
* [splayTree.py](./dataStructure/splayTree.py)
|
|
* [trie.py](./dataStructure/trie.py)
|
|
* [winnerTree.py](./dataStructure/winnerTree.py)
|
|
* [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)
|
|
* [README.md](./docs/README.md)
|
|
* [red-black-tree.md](./docs/red-black-tree.md)
|
|
* [sort.md](./docs/sort.md)
|
|
* [tree.md](./docs/tree.md)
|
|
* [dynamicProgramming](./dynamicProgramming)
|
|
* [lcs.hs](./dynamicProgramming/lcs.hs)
|
|
* [lcs.py](./dynamicProgramming/lcs.py)
|
|
* [matrix-multiply.py](./dynamicProgramming/matrix-multiply.py)
|
|
* [splitStripe.hs](./dynamicProgramming/splitStripe.hs)
|
|
* [splitStripe.py](./dynamicProgramming/splitStripe.py)
|
|
* [testVec2d.hs](./dynamicProgramming/testVec2d.hs)
|
|
* [Vec2d.hs](./dynamicProgramming/Vec2d.hs)
|
|
* [math](./math)
|
|
* [cantor.cc](./math/cantor.cc)
|
|
* [isPrime.py](./math/isPrime.py)
|
|
* [num_weight.py](./math/num_weight.py)
|
|
* [README.md](./README.md)
|
|
* [search](./search)
|
|
* [8Astar.py](./search/8Astar.py)
|
|
* [sort](./sort)
|
|
* [binaryTree.py](./sort/binaryTree.py)
|
|
* [heapSort.py](./sort/heapSort.py)
|
|
* [quickSort.py](./sort/quickSort.py)
|
|
* [radixSort.py](./sort/radixSort.py)
|
|
* [select.py](./sort/select.py)
|
|
* [shellSort.py](./sort/shellSort.py)
|
|
* [string](./string)
|
|
* [manacher.py](./string/manacher.py)
|
|
* [markov.py](./string/markov.py)
|
|
* [sunday.py](./string/sunday.py)
|