In the following Quick Sort algorithm, the last element in the array is selected as Pivot. We are going to select the Median of the data in the array as Pivot. 1. Make the appropriate changes in the following algorithms. Indicate which line (line number) in each algorithm is to be modified and what are the changes. 2 In the original algorithm, the complexity of Quick Sort is "n Log (n)". What would be the complexity with Median as Pivot? Why? Note: For part 2, there is no need to provide proof but you should justify your answer. PARTITION(A, p.r) x = A[r] 2 i = p-1 3 for j = p to r-1 if A[j] < x i =i+1 5 6. exchange A[i] with A[j] 7 exchange A[i + I] with A[r] return i + 1 QUICKSORT(A. p.r) 1 if p

Below is the exercise for unsorted arrays. True or False: For each statement below, indicate whether you think it is True or False 3) For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element 5) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario 6) If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) 7) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)

Given two sorted arrays, write a function to merge them into a single sorted array. What is the time complexity of your solution?

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.

Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation

Java: Consider the following algorithm for searching in an unsorted array. If the size of the array is 1, then check if it contains the element to be searched. Otherwise, divide the array into two halves, and  recursively search both halves. Which of (a)–(c) is false? The running time of this algorithm is O(N) The actual running time of this algorithm is likely to be better than sequential search. This is an example of a divide‐and‐conquer algorithm all of the above are true none of the above is true

I need help with this please. Make sure to add your reasonsand arguments for your decisions.

Please anwser the following question regarding ios app development.