algorithm-in-python/README.md

# Algorithm 
>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
* [.](.)
    * [README.md](./README.md)
    * [backtracking](./backtracking)
    * [dataStructure](./dataStructure)
        * [allOone](./dataStructure/allOone)
        * [bTree.py](./dataStructure/bTree.py)
        * [binaryHeap.py](./dataStructure/binaryHeap.py)
        * [binaryTree.py](./dataStructure/binaryTree.py)
        * [graph](./dataStructure/graph)
        * [hashTable.py](./dataStructure/hashTable.py)
        * [huffman](./dataStructure/huffman)
        * [intervalTree.py](./dataStructure/intervalTree.py)
        * [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)
        * [redBlackTree0.py](./dataStructure/redBlackTree0.py)
        * [splayTree.py](./dataStructure/splayTree.py)
        * [trie](./dataStructure/trie)
        * [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)
        * [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)
    * [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)
    * [math](./math)
        * [README.md](./math/README.md)
        * [euler.py](./math/euler.py)
        * [factor.py](./math/factor.py)
        * [gcd.py](./math/gcd.py)
        * [isPrime.py](./math/isPrime.py)
        * [modulo_equation.py](./math/modulo_equation.py)
        * [num_weight.py](./math/num_weight.py)
        * [permute_back_track.py](./math/permute_back_track.py)
        * [permute_cantor.c](./math/permute_cantor.c)
        * [permute_divide_and_conquer.py](./math/permute_divide_and_conquer.py)
        * [permute_next_arrangement.c](./math/permute_next_arrangement.c)
        * [primesLEn.hs](./math/primesLEn.hs)
    * [numericalAnalysis](./numericalAnalysis)
        * [README.md](./numericalAnalysis/README.md)
        * [interplotion.py](./numericalAnalysis/interplotion.py)
        * [iteration.py](./numericalAnalysis/iteration.py)
        * [least_square.py](./numericalAnalysis/least_square.py)
        * [linear_equation.py](./numericalAnalysis/linear_equation.py)
        * [numerical_differential.py](./numericalAnalysis/numerical_differential.py)
        * [numerical_integration.py](./numericalAnalysis/numerical_integration.py)
        * [solve-linear-by-iteration.py](./numericalAnalysis/solve-linear-by-iteration.py)
        * [vector_norm.py](./numericalAnalysis/vector_norm.py)
    * [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)
    * [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)
        * [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)
        * [src](./string/src)
        * [sunday.py](./string/sunday.py)
        * [wildcard_matching.py](./string/wildcard_matching.py)
    * [utils](./utils)
        * [config.py](./utils/config.py)
        * [genReadme.py](./utils/genReadme.py)
        * [headinfo.py](./utils/headinfo.py)
        * [tree.py](./utils/tree.py)