자료구조 & 알고리즘/퀵 정렬

public class Main { public static void quickSort(int[] arr, int left, int right) { if (left >= right) { return; } int pivot = partition(arr, left, right); quickSort(arr, left, pivot - 1); quickSort(arr, pivot + 1, right); } public static int partition(int[] arr, int left, int right) { int pivot = left; int lo = left; //arr[lo]가..