编程：关于程序的时间复杂度

2014.4.12

参考材料：Data Structures, Algorithms and Applications in C++

2.3 Time Complexity

1: 对于估计时间复杂度来说，有比较精细的计算方法，这时我们要知道" the time needed for an arithmetic operation depends on the type(int, lfoat, doule, etc.)"

另外两种估计的方法，一是" Identify one or more key operations and determine the number of times these are performed "；一是" determine the total number of strps executed by the program. "

2: 对于通过估计某个操作的运行次数来估计时间复杂度这种方法，选择不同的操作估计的时间复杂度可能都不一样，关键在于你选择的操作运行时间是不是贡献了程序主要时间。

3: " The average operation count is often quite difficult to determine. As a result, in some applications, we limit our analysis to determining the best and worst counts. "