1、算法的概念
-----------------------------------------------------------------------------------------------------------------
2、时间复杂度
-----------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------------------------
3、空间复杂度
时间比空间重要,追求的是时间,宁可占用内存也要时间短,快速获取结果。
4、复习:递归
递归的两个特点:
(1)调用自身
(2)结束条件
func1和func2不符合递归条件
func3与func4的区别:
-----------------------------------------------------------------------------------------------------------
func3先打印后递归:3 2 1
func4先递归后打印:1 2 3
递归实例:汉诺塔问题
def hanoi(n,a,b,c): if n>0: hanoi(n-1,a,c,b) print('moving from %s to %s'%(a,c)) hanoi(n-1,b,a,c) hanoi(3,'A','B','C')
moving from A to C
moving from A to B
moving from C to B
moving from A to C
moving from B to A
moving from B to C
moving from A to C