算法
厨房小菜刀
这个作者很懒,什么都没留下…
展开
-
python写基础排序:冒泡、插入、选择
from random import shuffledef bubble_sort(seq): for i in range(len(seq)): for j in range(len(seq)-1, i, -1): if seq[j] < seq[j-1]: tmp = seq[j] seq[j] = seq[j-1] seq[j-1] = tmpdef原创 2013-11-07 17:05:40 · 523 阅读 · 0 评论 -
python写希尔、堆、快速、归并排序
1 希尔排序:def shell_sort(seq): gap = len(seq)/2 #pdb.set_trace() while gap > 0: for i in range(0, gap): for j in range(i+gap, len(seq), gap): for k in range(i, j, gap): if seq[j] < seq原创 2013-11-18 10:04:54 · 902 阅读 · 1 评论