Data Structures, Algorithms, Java, Big O Notation, Searching And Sorting.
sort(int arr[], int left, int right) { if (left < right) { // Find the middle point int mid = left + (right - left) / 2; // Sort first and second halves sort(arr, left, mid); sort(arr, mid + 1, right); // Merge the sorted halves merge(arr, left, mid, right); } } 4.6 Quick sort The space complexity