python递归函数例题_Python写递归函数有什么典型的例题？

1、归并排序

# Recursively implementation of Merge Sort

def merge(left, right):

result = []

while left and right:

if left[0] <= right[0]:

result.append(left.pop(0))

else:

result.append(right.pop(0))

if left:

result += left

if right:

result += right

return result

def merge_sort(L):

if len(L) <= 1:

# When D&C to 1 element, just return it

return L

mid = len(L) // 2

left = L[:mid]

right = L[mid:]

left = merge_sort(left)

right = merge_sort(right)

# conquer sub-problem recursively

return merge(left, right)

# return the answer of sub-problem

if __name__ == "__main__":

test = [1, 4, 2, 3.6, -1, 0, 25, -34, 8, 9, 1, 0]

print("original:", test)

print("Sorted:", merge_sort(test))

2、快速排序（英语：Quicksort）

def quick_sort(lst):

if len(lst) <= 1:

return lst

less = []

greater = []

pivot = lst.pop()

for item in lst:

if item < pivot:

less.append(item)

else:

greater.append(item)

lst.append(pivot)

return quick_sort(less) + [pivot] + quick_sort(greater)

3、树 遍历

# Python program to for tree traversals

# A class that represents an individual node in a

# Binary Tree

class Node:

def __init__(self,key):

self.left = None

self.right = None

self.val = key

# A function to do inorder tree traversal

def printInorder(root):

if root:

# First recur on left child

printInorder(root.left)

# then print the data of node

print(root.val),

# now recur on right child

printInorder(root.right)

# A function to do postorder tree traversal

def printPostorder(root):

if root:

# First recur on left child

printPostorder(root.left)

# the recur on right child

printPostorder(root.right)

# now print the data of node

print(root.val),

# A function to do preorder tree traversal

def printPreorder(root):

if root:

# First print the data of node

print(root.val),

# Then recur on left child

printPreorder(root.left)

# Finally recur on right child

printPreorder(root.right)

# Driver code

root = Node(1)

root.left = Node(2)

root.right = Node(3)

root.left.left = Node(4)

root.left.right = Node(5)

print "Preorder traversal of binary tree is"

printPreorder(root)

print "\nInorder traversal of binary tree is"

printInorder(root)

print "\nPostorder traversal of binary tree is"

printPostorder(root)

等等。