Algorthim of how to find the largest element missing in an unsorted array of n positive integers and the running time of the algorthim is in O(n). Example of this is that the n=6 array C= [5,90,8,6,26,9] The largest element missing in the array is 7

1. Asymptotics. Given an array A of n integers, you'd like to output a two-dimensional n x n array B in which B[i, j] = max {A[i], A[i + 1],..., A[j]} for each i < j. For i j the value of B[i, j] can be left as is. for i = 1,2, η for j = i + 1, n " Compute the maximum of the entries A[i], A[i + 1], , A[j]. Store the maximum value in B[i, j]. (a) Find a function of such that the running time of the algorithm is O(f(n)), and clearly explain why. (b) For the same function f argue that the running time of the algorithm is also (f(n)). (This establishes an asymptotically tight bound (f(n)).) (c) Design and analyze a faster algorithm for this problem. You should give an algorithm with running O(g(n)), where lim→∞ g(n)/f(n) = 0.

Hi I was wondering if I could get help with this question. I know that the first five will make the largest sum of 9 but I don't where to go from there Thanks

Give a big-Oh characterization, in terms of n, of the running time of the followingmethod.

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.