What is the difficulty of randomized quick sort in terms of both the auxiliary space and the average amount of time it takes?

What arrangement of keys is a best case for Bubble Sort, that is, for what input does it do the fewest comparisons? How many comparisons does it do in the best case?

How much time and space does randomized rapid sort use on average?

For the given quick sort algorithm example, I would like to see comments added to explain some of the functionality the algroithm is doing. Thank you

Using selection sort, Sort the following array from greatest to least write down what the array AA and the sortedsorted array will look like at each step.

The algorithm: –In an array of n elements, go to index [n/2] –If the record there is the one you want, you are done –If the record value there is smaller than your search value, all records less than the current record can be ignored – set your search range of elements to [n/2+1…n] and return to step 1 –Otherwise, set your range of elements to [0…(n/2)-1] and return to step 1 –Repeat this loop until you have 0 elements (record is not found) or record is found Short answer Another approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value. Explain in your own words if you think this approach is significantly better, worse, or in the same category as the algorithm discussed in the slides, and why.

What is the auxiliary space complexity and average time complexity of randomized rapid sort?

explain Selection sort algorithm.

For selection sort, how many comparisons would be needed to sort an array containing 100 elements if the original array elements were already sorted? What if the original array elements were sorted in reverse order? What if the original array elements were all identical?

Compare the sorting times of the insertion sort with QuickSort using a small array (less than 20). What is the time difference? Could you explain why?