# Introduction

<table data-view="cards"><thead><tr><th></th><th data-type="content-ref"></th><th data-type="content-ref"></th><th data-type="content-ref"></th><th data-type="content-ref"></th><th data-type="content-ref"></th><th data-type="content-ref"></th></tr></thead><tbody><tr><td>基础知识</td><td><a href="basic-knowledge/recursion">recursion</a></td><td><a href="basic-knowledge/iteration">iteration</a></td><td><a href="basic-knowledge/divide-and-conquer">divide-and-conquer</a></td><td><a href="basic-knowledge/complexity">complexity</a></td><td></td><td></td></tr><tr><td>数据结构</td><td><a href="data-structure/array">array</a></td><td><a href="data-structure/string">string</a></td><td><a href="data-structure/linked-list">linked-list</a></td><td><a href="data-structure/hash-set">hash-set</a></td><td><a href="data-structure/binary-tree">binary-tree</a></td><td><a href="data-structure/stack-and-queue">stack-and-queue</a></td></tr><tr><td>排序</td><td><a href="sort/bubble-selection-and-insertion-sort">bubble-selection-and-insertion-sort</a></td><td><a href="sort/quick-sort">quick-sort</a></td><td><a href="sort/merge-sort">merge-sort</a></td><td><a href="sort/heap-sort">heap-sort</a></td><td><a href="sort/linear-complexity-sort-algorithm">linear-complexity-sort-algorithm</a></td><td></td></tr><tr><td>算法设计</td><td><a href="algorithm-design/double-pointers">double-pointers</a></td><td><a href="algorithm-design/binary-search">binary-search</a></td><td><a href="algorithm-design/dynamic-planning">dynamic-planning</a></td><td><a href="algorithm-design/greedy">greedy</a></td><td><a href="algorithm-design/back-track">back-track</a></td><td><a href="algorithm-design/sliding-window">sliding-window</a></td></tr><tr><td>高级数据结构</td><td><a href="advanced-data-structure/red-black-tree">red-black-tree</a></td><td><a href="advanced-data-structure/monotone-stack">monotone-stack</a></td><td><a href="advanced-data-structure/priority-queue">priority-queue</a></td><td><a href="advanced-data-structure/segment-tree">segment-tree</a></td><td><a href="advanced-data-structure/b-tree">b-tree</a></td><td></td></tr><tr><td>图</td><td><a href="graph/dfs">dfs</a></td><td><a href="graph/bfs">bfs</a></td><td><a href="graph/dijstra">dijstra</a></td><td><a href="database/union">union</a></td><td></td><td></td></tr><tr><td>数学</td><td><a href="math">math</a></td><td><a href="math/number-theory">number-theory</a></td><td><a href="math/bit-manipulation">bit-manipulation</a></td><td></td><td></td><td></td></tr><tr><td>数据库</td><td><a href="database/database">database</a></td><td><a href="database/group-by-having">group-by-having</a></td><td><a href="database/join-on">join-on</a></td><td><a href="database/update">update</a></td><td><a href="database/union">union</a></td><td><a href="database/order-by">order-by</a></td></tr><tr><td>Shell</td><td><a href="shell/awk">awk</a></td><td><a href="shell/grep">grep</a></td><td><a href="shell/sed">sed</a></td><td></td><td></td><td></td></tr></tbody></table>

{% hint style="info" %}
所有题目著作权归领扣网络所有。
{% endhint %}