高级算法设计2020fall

高级算法设计2020fall

2020.11.9 G707 10：30-12：30

五道选择

1.排序算法时间复杂度
2.忘了
3.树的第k层节点数
4.B tree中t代表each node other than root at least t-1 keys, t children, at most 2t-1 keys
5.dynamic program和greedy algorithm共同点 ->optimal substructure

master method

T(n) = 3T(n/2)+n^2-n+3

hash

linear probing
quadratic probing
double hashing
Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table of length m=11 using open addressing with the primary hash function h^’ (k)=k mod m. Illustrate the result of inserting these keys using linear probing, using quadratic probing with c1=1 and c2=3, and using double hashing with h_2 (k)=1+(k mod (m-1)).

red black tree

insertion process
use R and B represen