- 博客(4)
- 收藏
- 关注
原创 Binary Search
# Binary Search def binarySearch(alist, target): right = 0 left = len(alist) - 1 found = False while right <= left and not found: midpoint = (right + left)//2 if a...
2018-07-20 15:12:17
540
原创 Quick Sort
def quickSort(alist): subQuickSort(alist, 0, len(alist)-1) def subQuickSort(alist, first, last): if first < last: slitpoint = partition(alist, first, last) subQuickSort(al...
2018-07-20 15:08:06
217
原创 Selection Sort
def selectionSort(alist): a = len(alist)-1 while a > 0: flag = 0 for i in range(0,a+1): if alist[i] > alist[flag]: flag = i alist[a],...
2018-07-20 15:04:08
253
原创 Bubble Sort
def bubbleSort(alist): item = len(alist)-1 while item > 0: for sort_item in range(0,item): #compare with the adjacent element if alist[sort_item]>=alist[...
2018-07-20 15:00:55
221
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人
RSS订阅