dev:kb:data_structure_algorithm
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
dev:kb:data_structure_algorithm [2014/05/15 08:20] – created hackerzhou | dev:kb:data_structure_algorithm [2020/06/06 23:32] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Data Structure & Algorithm ====== | ====== Data Structure & Algorithm ====== | ||
+ | |||
+ | ===== Array ===== | ||
+ | * Quick Sort | ||
+ | * Merge Sort | ||
+ | * Insertion Sort | ||
+ | * Bubble Sort | ||
+ | * Shell Sort | ||
+ | * Bucket Sort | ||
+ | * Radix Sort | ||
+ | * Heap Sort | ||
+ | ===== Stack ===== | ||
+ | |||
+ | ===== Queue ===== | ||
+ | === Priority Queue === | ||
+ | |||
+ | ===== Heap ===== | ||
+ | |||
+ | ===== Linked List ===== | ||
+ | ==== Singly Linked Lists ==== | ||
+ | ==== Doubly Linked Lists ==== | ||
+ | ===== Tree ===== | ||
+ | ==== B-Tree ==== | ||
+ | === B+ Tree === | ||
+ | === B* Tree === | ||
+ | ==== Binary Search Tree ==== | ||
+ | === Balanced Binary Search Tree === | ||
+ | == AVL Tree == | ||
+ | == Red-black Tree == | ||
+ | ==== Trie ==== | ||
+ | |||
+ | ==== Radix Tree ==== | ||
+ | ===== Graph ===== | ||
+ | * Breadth First Search | ||
+ | * Depth First Search | ||
+ | |||
+ | ===== Hash ===== | ||
+ | |||
+ | ===== String Algorithm ===== | ||
+ | |||
+ | ===== Dynamic Programming ===== |
dev/kb/data_structure_algorithm.1400142039.txt.gz · Last modified: 2020/06/06 23:32 (external edit)