- 博客(5)
- 收藏
- 关注
RSS订阅原创 算法导论计数排序python实现
#-*-coding:UTF-8-*-def countsort(A,k): n = len(A) B = [] result = [None for i in xrange(n)] for i in range(k+1): B.append(0) for j in range(n): B[A[j]]+=1 for
2015-03-12 20:50:40
346
原创 算法导论快速排序python实现
#-*-coding:UTF-8-*-import sysimport random#sys.setrecursionlimit(1000000)def quicksort(A,p,r): if p<r: x= random.randint(p, r) A[x],A[r]=A[r],A[x] q=partition(A
2015-03-10 23:04:45
471
原创 算法导论堆排序python实现
#-*-coding:utf-8-*-def max_heap(A, i, heapsize): largest = -1 while True: left = 2*i+1 right = 2*i + 2 if left<heapsize and A[i]<A[left]: largest=left
2015-03-09 00:03:44
377
原创 算法导论合并排序算法python实现
#-*-coding:UTF-8-*-def merge(arr1, arr2): arr = [] len1 = len(arr1) len2 = len(arr2) i=0 j=0 while i<len1 and j<len2: if arr1[i]<arr2[j]: arr.append(arr1[i])
2015-03-04 23:17:13
352
原创 算法导论插入排序算法python实现
#-*-coding:UTF-8-*-def insertsort(numlist): length = len(numlist) for j in range(1, length): key=numlist[j] k = j-1 while k>=0 and key > numlist[k]: numli
2015-03-04 22:33:30
307
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人