arr = [3, 11, 51425, 38, 2, 4, 6, 7,11,-5,20,78,100,-52,79,10,1052]
def quicksort(arr,lo,hi):
#print arr
if lo >= hi:
return
q = arr[lo]
i = lo + 1
for j in range(i, hi+1):
if arr[j] < q:
arr[i], arr[j] = arr[j], arr[i]
i += 1
arr[i-1], arr[lo] = arr[lo], arr[i-1]
#arr[i-1] = q
#arr[lo] = temp
quicksort(arr,lo, i-2)
quicksort(arr,i,hi)
#print lo, i-2
#print i, hi
print 'length of arr:',len(arr)
print arr
quicksort(arr,0,len(arr)-1)
print arr
今天晚上写的。looks like functioning~