Quick sort
public static void main(String[] args) { int[] src = new int[]{1, 9, 8, 5, 4, 2, 3, 7, 6}; printArray(src); midPivotSort(src, 0, src.length-1); printArray(src); } private static void midPivotSort(int[] src, int start, int end) { if(start >= end) return; int part = partition(src, start, end); if(start < part-1) midPivotSort(src, start, part-1); if(part < end) midPivotSort(src, part, end); } priva..
2023. 8. 1.
Merge sort
출처 : https://en.wikipedia.org/wiki/Merge_sort public static void main(String[] args) { int[] src = new int[]{1, 9, 8, 5, 4, 2, 3, 7, 6}; int[] tmp = new int[src.length]; printArray(src); mergeSort(src, tmp, 0, src.length-1); printArray(src); } private static void mergeSort(int[] src, int[] tmp, int start, int end) { if(start < end) { int mid = (start + end) / 2; mergeSort(src, tmp, start, mid); ..
2023. 8. 1.
