python 一些简单的算法

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

def search2(alist, num):
low = 0
high = len(alist) - 1
while low <= high:
mid = (low+high) / 2
mid_val = a[mid]
if mid_val < m:
low = mid + 1
elif mid_val > m:
high = mid - 1
else:
return mid

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