공부/자료 구조 및 알고리즘
2022. 10. 25.
퀵정렬 (Quick Sort) - python
def partition(arr, start, end): pivot = start greater = start + 1 less = end while greater = end: return k = partition(arr, start, end) quickSort(arr, start, k - 1) quickSort(arr, k + 1, end) arr = [31, 53, 75, 42, 15, 64, 31] #정렬할 배열 print("[정렬되지 않은 배열]") print(arr) print() start = 0 end = len(arr) - 1 quickSort(arr, start, end) print("[정렬 완료된 배열]") print(arr) [정렬되지 않은 배열] [31, 53, 75, 42, 15, ..