Quick Sort 소스
public class QuickSort {static int i = 0;public static void QuickSort(int[] a,int begin, int end) {if(begin < end){int p = partition(a, begin, end);QuickSort(a,begin,p-1);QuickSort(a,p + 1, end);}}public static int partition(int[] a, int begin, int end){int pivot = (begin + end) / 2;int L = begin;int R = end;int temp;System.out.println("[퀵 정렬 " + ++i + "단계: pivot: " + a[pivot]);while(L < R){whil..