below is the code for quick sort. Modify this code so it runs in O(nlogn) time on sorted input. int partition(std::vector arr, int p, int r) int pivot int i=p for (int arr[r]; 1; p;j