두덕리온라인

C++ quick sort 퀵 정렬 void quickSort(vector& nums, int l, int r) { if (l >= r) return; int mid = partition(nums, l, r); quickSort(nums, l, mid); quickSort(nums, mid + 1, r); } int partition(vector& nums, int l, int r) { int pivot = nums[l]; while (l = pivot) r--; nums[l] = nums[r]; while (l < r && nums[l]

C언어 quick sort 예제입니다. int data[7] = { 3, 5, 1, 2, 6, 9, 7 }; void swapInt(int & a, int & b) { int tmp = a; a = b; b = tmp; } void printArr(int arr[]) { printf("arr="); for (int i = 0; i < 7; i++) { printf("%d ", arr[i]); } printf("\n"); } void quickSort(int arr[], int left, int right) { printf("left=%d right=%d\n", left, right); int i = left; int j = right; printArr(arr); int pivotIndex = (left ..