1.1 算法的时间复杂度分析
- e.g. 1.4 This example is use do to illustrate the average, worst-case and best case cost for running an algorithm
- description of the example: find the element you want in an array using sequential selectin method.
- The hanoi problem could be illustrated as a typical example to show the time complexity by using recursive methods.