python 一些简单的算法

 

1 def qsort(alist):
2     if not a:
3         return []
4     else:
5         return qsort([i for i in alist[1:] if i < alist[0]] + \
6                             alist[0:1] + \
7                             [j for j in alist[1:] if j >= alist[0]])

快速排序。

 1 def search2(alist, num):
 2     low = 0
 3     high = len(alist) - 1
 4     while low <= high:
 5         mid = (low+high) / 2
 6         mid_val = a[mid]
 7         if mid_val < m:
 8             low = mid + 1
 9         elif mid_val > m:
10             high = mid - 1
11         else:
12             return mid

 二分查找

1 def bubbleSort(alist):
2     for i in range(len(alist)-1, 0, -1):
3         for j in range(i):
4             if alist[j] > alist[j+1]:
5                 alist[j], alist[j+1] = alist[j+1], alist[j]

冒泡排序

转载于:https://www.cnblogs.com/h3idan/p/3178667.html