[C++언어] 퀵 정렬 (Quick sort) 알고리즘

#include using namespace std; void quick(int *array, int left, int right) { int pivot = left; int left_pivot = left; int right_pivot = right; while (left_pivot < right_pivot) { while (array[left_pivot] <= array[pivot] && left_pivot < right) { left_pivot += 1; } while (array[right_pivot] >= array[pivot] && right_pivot > left) { right_pivot -= 1; } if (left_pivot < right_pivot) { swap(array[left_pivot], array[right_pivot]); continue; } swap(array[pivot], array[right_pivot]); quick(arra...