@
soulomoon 所以没必要全做完,性价比很低,除非你是研究算法方向 PHD 。
工作的话,数据结构和重要的算法设计的方法掌握就可以了。然后就是刷题
Big-Oh Notations
Proof Methods: Loop Invariant, Proof by Induction
Complexity Analysis Methods: Iteration Method, Substitution Method, Master Method, Recursion Tree, Amortized Analysis
Data Structures: Linked List, Stack, Queue, Heap, Hash Table, BST, B Tree, B+ Tree, AVL Tree, RB Tree, Disjoint Sets
Sorting Algorithms:
O(nlog(n)): Quick Sort, Merge Sort, Heap Sort
O(n): Counting Sort, Radix Sort, Bucket Sort
O(n^2): Insertion Sort, Bubble Sort, Selection Sort
Medians and Order Statistics
Divide and Conquer
Dynamic Programming
Greedy Algorithms
Graph Algorithms
NP Completeness