mit 计算机科学及编程导论(9)

来源:互联网 发布:淘宝卖家账号怎么注册 编辑:程序博客网 时间:2024/05/29 05:55

words:

recap , snore , premise , chop , halt , sneak , amortize , split , punchline , bubble , sneeze , conquer

notes:

1.  binary search : be careful of the implement of the list , whether it is random access or linear access will affect the complexity

2. how to do the sort:

     one method uses loop invariant to split the list into ordered prefix part and disordered suffix : selection sort  and  bubble sort(n*n)

     other one is divide & conquer method .(n.log n )