This commit is contained in:
mbinary 2019-03-18 01:01:32 +08:00
parent 2881d7c066
commit 270e077cf9
3 changed files with 12 additions and 6 deletions

View File

@ -6,6 +6,7 @@
[![repo-size](https://img.shields.io/github/repo-size/mbinary/algorithm.svg)]() [![repo-size](https://img.shields.io/github/repo-size/mbinary/algorithm.svg)]()
[![License](https://img.shields.io/badge/LICENSE-WTFPL-blue.svg)](LICENSE) [![License](https://img.shields.io/badge/LICENSE-WTFPL-blue.svg)](LICENSE)
[![Language](https://img.shields.io/badge/language-python3-orange.svg)]() [![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)
<!-- [![Build](https://travis-ci.org/mbinary/PL0-compiler.svg?branch=master)]() --> <!-- [![Build](https://travis-ci.org/mbinary/PL0-compiler.svg?branch=master)]() -->
>Notes and codes for learning algorithm and data structures :smiley: >Notes and codes for learning algorithm and data structures :smiley:
@ -14,12 +15,12 @@ Some pictures and ideas are from `<<Introduction to Algotithm>>`
I use python 3.6+ and c/c++ to implement them. I use python 3.6+ and c/c++ to implement them.
[Click here](https://mbinary.xyz/algorithm/) to view notes
[Click here](https://mbinary.xyz/alogrithm) to view notes
# Index # Index
* [.](.) * [.](.)
* [LICENSE](./LICENSE) * [LICENSE](./LICENSE)
* [README.md](./README.md) * [README.md](./README.md)
* [_config.yml](./_config.yml)
* [backtracking](./backtracking) * [backtracking](./backtracking)
* [dataStructure](./dataStructure) * [dataStructure](./dataStructure)
* [allOone](./dataStructure/allOone) * [allOone](./dataStructure/allOone)
@ -48,6 +49,7 @@ I use python 3.6+ and c/c++ to implement them.
* [min_distance_of_n_points.py](./divideAndConquer/min_distance_of_n_points.py) * [min_distance_of_n_points.py](./divideAndConquer/min_distance_of_n_points.py)
* [docs](./docs) * [docs](./docs)
* [README.md](./docs/README.md) * [README.md](./docs/README.md)
* [_config.yml](./docs/_config.yml)
* [algorithm-general.md](./docs/algorithm-general.md) * [algorithm-general.md](./docs/algorithm-general.md)
* [b-tree.md](./docs/b-tree.md) * [b-tree.md](./docs/b-tree.md)
* [fib-heap.md](./docs/fib-heap.md) * [fib-heap.md](./docs/fib-heap.md)
@ -68,14 +70,20 @@ I use python 3.6+ and c/c++ to implement them.
* [testVec2d.hs](./dynamicProgramming/testVec2d.hs) * [testVec2d.hs](./dynamicProgramming/testVec2d.hs)
* [wildcard_matching.py](./dynamicProgramming/wildcard_matching.py) * [wildcard_matching.py](./dynamicProgramming/wildcard_matching.py)
* [graph](./graph) * [graph](./graph)
* [cloneGraph.cpp](./graph/cloneGraph.cpp)
* [isBipartGraph.py](./graph/isBipartGraph.py) * [isBipartGraph.py](./graph/isBipartGraph.py)
* [math](./math) * [math](./math)
* [README.md](./math/README.md) * [README.md](./math/README.md)
* [convertWeight.py](./math/convertWeight.py) * [convertWeight.py](./math/convertWeight.py)
* [fastPow.py](./math/fastPow.py) * [fastPow.py](./math/fastPow.py)
* [fibonacci](./math/fibonacci)
* [numberTheory](./math/numberTheory) * [numberTheory](./math/numberTheory)
* [numericalAnalysis](./math/numericalAnalysis) * [numericalAnalysis](./math/numericalAnalysis)
* [permute](./math/permute) * [permute](./math/permute)
* [parser](./parser)
* [PL0-compiler](./parser/PL0-compiler)
* [calculator](./parser/calculator)
* [declarationParser](./parser/declarationParser)
* [search](./search) * [search](./search)
* [8Astar.py](./search/8Astar.py) * [8Astar.py](./search/8Astar.py)
* [BFS_knight.hs](./search/BFS_knight.hs) * [BFS_knight.hs](./search/BFS_knight.hs)
@ -102,6 +110,7 @@ I use python 3.6+ and c/c++ to implement them.
* [sunday.py](./string/sunday.py) * [sunday.py](./string/sunday.py)
* [wildcard_matching.py](./string/wildcard_matching.py) * [wildcard_matching.py](./string/wildcard_matching.py)
* [utils](./utils) * [utils](./utils)
* [codecogs.py](./utils/codecogs.py)
* [config.py](./utils/config.py) * [config.py](./utils/config.py)
* [genReadme.py](./utils/genReadme.py) * [genReadme.py](./utils/genReadme.py)
* [headinfo.py](./utils/headinfo.py) * [headinfo.py](./utils/headinfo.py)

View File

@ -27,7 +27,6 @@ description:
<!-- /TOC --> <!-- /TOC -->
<a id="markdown-1-背景" name="1-背景"></a> <a id="markdown-1-背景" name="1-背景"></a>
{% note info %}从此心里有了B数(●'◡'●){% endnote %}
# 1. 背景 # 1. 背景
当有大量数据储存在磁盘时,如数据库的查找,插入, 删除等操作的实现, 如果要读取或者写入, 磁盘的寻道, 旋转时间很长, 远大于在 内存中的读取,写入时间. 当有大量数据储存在磁盘时,如数据库的查找,插入, 删除等操作的实现, 如果要读取或者写入, 磁盘的寻道, 旋转时间很长, 远大于在 内存中的读取,写入时间.

View File

@ -15,9 +15,7 @@ Some pictures and ideas are from `<<Introduction to Algotithm>>`
I use python 3.6+ and c/c++ to implement them. I use python 3.6+ and c/c++ to implement them.
# Notice [Click here](https://mbinary.xyz/algorithm/) to view notes
Currently, Github can't render latex math formulas.Thus,if you want to view the markodwn notes which contain latex math formulas, you can visit [my blog](https://mbinary.xyz)
# Index # Index
{index} {index}
''' '''