1. 时间复杂度
O(1): constant
O(logn): logarithmic
O(n): linear
O(nlogn): linearithmic
O(n^2): quadratic
O(2^n): exponential
O(n!): factorial
2. 结构
2.1 基本结构
Arrays, Linked Lists, Binary Search Tree, Hash Table
2.2 特殊结构(抽象数据类型ADTs)
Stack, Queue, Priority
LIFO FIFO
2.3 Java Collections
Interface Implementation
List ArrayList, ListedList
Set HashSet, TreeSet
Map HashMap, TreeMap
List:extend Collection,可以有重复
Set :extend Collection,无重复
Map :没有extend Collection,无重复键,键值对
常用方法:
添加,删除,排序,查找,遍历,拷贝
3. 排序
Bubble Sort, Selection Sort, Insertion Sort
Quick Sort, Merge Sort(原地)
Heap Sort
其它:Binary Tree Sort, Buck Sort, Counting Sort, 希尔排序, 基数排序
4. graph