Quick Sort

[+] Quick Sort

- 불안정 정렬(Not Stable Sort)

- 복잡도는최악의 경우  O(n²), 평균 O(n log n)

- https://ko.wikipedia.org/wiki/%ED%80%B5_%EC%A0%95%EB%A0%AC

def quicksort(x): if len(x) <= 1: return x pivot = x[len(x)/2] less = [] more = [] equal = [] for a in x: if a > pivot: more.append(a) elif a < pivot: less.append(a) else: equal.append(a) return quicksort(less) + equal + quicksort(more) if __name__ == "__main__": import random A = [] for i in range(0, 10): A.append(random.randrange(0, 1000)) print "[+] Before Quick Sort" print "A :", A print '' print "[+] After Quick Sort" print "A :", quicksort(A)