Write the code necessary to find the largest element in an unsorted array of integers. What is the time complexity of this algorithm?

In terms of auxiliary space and typical time complexity, how demanding is randomized quick sort?

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?

Given an integer array A[1..n] you are to list the k smallest elements. What method will you use when (i)k=0(1) Explain why you chose the algorithm you chose for parts (i)

Let M(n) be the minimum number of comparisons needed to sort an array A with exactly n ele- ments. For example, M(1) = 0, M(2) = 1, and M(4) = 4. If n is an even number, clearly explain why M(n) = 2M(n/2) + n/2.