# quickSort.py # ------------ # Licensing Information: Please do not distribute or publish solutions to this # project. You are free to use and extend these projects for educational # purposes. The Pacman AI projects were developed at UC Berkeley, primarily by # John DeNero (denero@cs.berkeley.edu) and Dan Klein (klein@cs.berkeley.edu). # For more info, see http://inst.eecs.berkeley.edu/~cs188/sp09/pacman.html def quickSort(lst): if len(lst) <= 1: return lst smaller = [x for x in lst[1:] if x < lst[0]] larger = [x for x in lst[1:] if x >= lst[0]] return quickSort(smaller) + [lst[0]] + quickSort(larger) # Main Function if __name__ == '__main__': lst = [2,4,5,1] print quickSort(lst)