To sort even larger arrays, compile the quickSort3.cpp programme. Make them large enough that you can use a stopwatch to time the sorting process. Then play about with different cutoff points (the size of the subarray below which the insertion sort is utilised). Determine the cutoff that delivers the best performance on your specific system.

A given implementation of bubble-sort takes on average 1 second to sort an array of 1000 elements. How many seconds do you expect sorting an array of 8000 elements will take? A given implementation of quicksort takes on average 0.1 seconds to sort an array of 1000 elements. How many seconds do you expect sorting an array of 8000 elements will take?

Make and implement a mergesort variation that gives an int[] array perm, where perm[i] is the index of the array's i th smallest element, rather than rearranges the array's elements.

Please explain What is the worse-case performance of quicksort? Select the correct answer with the correct justification. Group of answer choices a. O(n*n), because during the partitioning stage it is possible that we select a 'bad' random pivot point that only sorts one item at a time. If we continuously do this over and over again, we are effectively only sorting 1 item each time. We then need to perform this pivot step n more times to sort the remaining n-1 items, thus giving us an O(n*n) complexity.   b. O(n*n), because quicksort is a comparison-based sorting algorithm in which we have to compare every possible element against every other element in order to swap each element into the correct position.   c. O(n*log(n)), because each time we are selecting a pivot point, on the average-case we are able to split our problem into roughly two collections, and sort half of our elements at the pivot point.