'''
Created on 2013-8-23
@author: codegeek
'''
def bubble_sort(seq):
for i in range(len(seq)):
for j in range(i,len(seq)):
if seq[j] < seq[i]:
tmp = seq[j]
seq[j] = seq[i]
seq[i] = tmp
def selection_sort(seq):
for i in range(len(seq)):
position = i
for j in range(i,len(seq)):
if seq[position] > seq[j]:
position = j
if position != i:
tmp = seq[position]
seq[position] = seq[i]
seq[i] = tmp
def insertion_sort(seq):
if len(seq) > 1:
for i in range(1,len(seq)):
while i > 0 and seq[i] < seq[i-1]:
tmp = seq[i]
seq[i] = seq[i-1]
seq[i-1] = tmp
i = i - 1
if __name__ == __main__:
print --------bubble_sort-------------
seq = [22,1,33,4,7,6,8,9,11]
bubble_sort(seq)
print seq
print --------selection_sort-------------
seq = [88,44,11]
selection_sort(seq)
print seq
print --------insertion_sort-------------
seq = [777,1111,100,11]
insertion_sort(seq)
print seq
# End www.jb51.cc
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。