快速排序 python从java版本翻译过来：

# -*- coding:utf-8 -*-
#

class QuikSort(object):

def __init__(self,list):

self.list = list

def sort(self,left,right):

low = left
high = right
key = self.list[left]

while low < high:

while low < high and self.list[high] >= key:

high = high - 1

self.list[low] = self.list[high]

while low < high and self.list[low] <= key:

low = low + 1

self.list[high] = self.list[low]
self.list[low] = key

self.sort(left,low -1)
self.sort(low + 1,right)

def result(self):

for info in self.list:

print' ',info,

if __name__ == '__main__':

ll = [-9,8,1,2,5,4,7,6,3,9]
qs = QuikSort(ll)
qs.sort(0,len(ll) - 1)
qs.result()