Syllabus:

????model of computation->algorithm design & analysis techniques->computation complexity

學有余力、查一些算法：https://walkccc.me/CLRS/

Algorithm:

????model of computation

????algorithm design

????algorithm analysis

Model of computation:

????machine- and language- independent?algorithms,running on an abstract machine

????turing machine

????RAM model: simple but powerful

Algorithm design:

????composition of simple operations, to solve analgorithm problem

Algorithm analysis:

????amount of?work done/ memory used (on the worst/average case)

????advanced issues (optimality, approximation ratio...)

兩個算法例子：

????1.兩個非負整數(shù)（non-negative integers）m和n最大公約數(shù)GCD（greatest common divisor）

????2.在數(shù)組E[1..n]中找到關鍵字K

正確性：（一個一個試，試不完）對于任何合法輸入（包括corner?case），輸出總是正確的

證明正確性？數(shù)學歸納法（mathematical induction）

????weak / strong principle

算法分析：標準：例子：