15 快速排序

#!/usr/bin/python
# -*- coding: utf-8 -*-
class Solution(object):
    def quicksort(self,a,start,end):
        if not a or start >= end:
            return a
        temp = a[start]
        left,right = start,end
        while left < right:
            while a[right] >= temp and left < right:
                right -= 1
            a[left] = a[right]

            while a[left] <= temp and left < right:
                left += 1
            a[right] = a[left]
        a[left] = temp
        self.quicksort(a,start,left - 1)
        self.quicksort(a,left + 1,end)
        return a

if __name__ == "__main__":
    s = Solution()
    print s.quicksort([57, 68, 59, 52, 72, 28, 96, 33, 24],0,8)