mark's technic world

''' Created on 2017-1-6 @author: admin ''' def buildHeap(source,parent): if left(parent)>=len(source): return elif right(parent)>=len(source): if source[parent]>source[left(pa

''' Created on 2017-1-6 @author: admin ''' from builtins import range, int def mergeSort(source,start,end): if(start>=end): return middle=int((start+end)/2) mergeSort(source, st

''' Created on 2017-1-6 @author: admin ''' def bubbleSort(source): for i in reversed(range(len(source))): for j in reversed(range(len(source)-i,len(source))): if source[j]<so

''' Created on 2017-1-6 @author: admin ''' def quickSort(source,start,end): if start==end: return index=shuffle(source, start, end) if(index-1>start): quickSort(source, s

''' Created on 2017-1-6 @author: admin ''' def insertSort(source): for i in range(1,len(source)): for j in reversed(range(1,i+1)): if source[j]<source[j-1]: tm

''' Created on 2017-1-6 @author: admin ''' def selectSort(source): for i in range(len(source)): mins=source[i] index=i for j in range(i,len(source)): if(mins>s

''' Created on 2017-1-6 @author: admin ''' def shellSort(source): gap=len(source) while gap//2!=0: insertSort(source,gap//2) gap=gap//2 def insertSort(source,gap): for i