ADT : abstract data type,抽象数据类型
comparison model 对比模型
1、all input items are black boxes
2、only operation allowed are comparisons
3、time cost = comparsions
Decision Tree
Search lower bound
why the time is logn time?
Proof:
decision tree is binary & must have >= n leaves one for each answer
height >= logn
Linear-Time sorting
(Interger Sorting)
Counting Sort
Radix Sort
versus:对抗