1.) Suppose that you sort a large array of integers by using a merge sort. Next you use a binary search to determine whether a given integer occurs in the array. Finally, you display all of the integers in the sorted array.   a.) Which algorithm is faster, in general: the merge sort or the binary search? Explain in terms of Big O notation.   b.) Which algorithm is faster, in general: the binary search or displaying the integers? Explain in terms of Big O notation

c++

Subj:- Design & Anal Algorithms Please compelete all the three questions since it has to be answereda once. Thank you in advance. Three animals stand next to each other by size, as follows: An Elephant, followed by a Hippo, followed by a Panda bear, [E, H, P]. Your goal is to re-arrange them so that they are sorted in the opposite size-based order. You are only allowed to switch positions of neighboring animals. Do not use Insertion or Merge sort. Try to use your own strategy to re-arrange the array. (a) How many operations do you need to reverse the order of the three animals? (b) Let’s generalize the above. You have an array of n elements whose ordering you want to revers. Write pseudo code to do this. (c) How many operations do you need to reverse the ordering of an array of n? Your answer should be a function of n.

Java-.Selection and insertion sort  3.a    Show steps of selection sort for the given array. You may need to add more rows to the table.   Selection Sort Initial value 3 2 7 5 4 8 9 10 1 Search 0 . . . end 3 2 7 5 4 8 9 10 1 Swap index 0                   Search 1 . . . end                   . . .                                                                                                                                                               3.b    Show steps of insertion sort for the given array. You may need to add more rows to the table.   Insertion Sort Initial value 3 2 7 5 4 8 9 10 1 , first item is sorted 3 2 7 5 4 8 9 10 1 , first 2 items are…