Quicksort method
| 41 | |
| 42 | // Quicksort method |
| 43 | void quickSort(int arr[], int low, int high) { |
| 44 | if (low < high) { |
| 45 | int pIndex = partition_r(arr, low, high); |
| 46 | |
| 47 | // Separately sort elements before partition and after partition |
| 48 | quickSort(arr, low, pIndex - 1); |
| 49 | quickSort(arr, pIndex + 1, high); |
| 50 | } |
| 51 | } |
| 52 | |
| 53 | int main() { |
| 54 | int size; |