哈尔滨工业大学深圳 高级算法设计 2017 考试 复习题 重点.pdfVIP

Insertion Sort （原理及伪代码学习，第一次出现伪代码） Asymptotic Time Analysis : Big O (upper bound) and Big Ω (lower bound) Merge Sort (Divide-and-Conquer) Recurrences: three methods. Substitution method: guessverifysolve Recursion-tree method : Master method: 应用于形如T(n)=aT(n/b)+f(n),a=1,b1 证明主方法 Big Integer Multiplication Strassen matrix multiplication Chessboard Cover Shell Sort 缩小增量 Comparison Sort ( O(nlgn) the best we can do) Counting sort: No comparisons between elements. Counting sort is not a comparison sort. Counting sort is a stable sort: it preserves the input order among