Look at the following C++ pseudo code:   Binary_search(int a[], int size) { ……….// binary search and return }         Selection_Sort(int a[], int z) { …..// do the selection sort }   main() {     Selection_Sort(array, size);     Binary_Search(array, item); }   Calculate the time complexity of this code and use O() notation.

This sorting function and the merge one is very similar can someone help please? its in C++

In C++ Please summarize the differences between the following C++ sorting algorithms: Bubble Sort Merge Sort Selection Sort Insertion Sort Quick Sort Provide 2 - 3 sentences about each and your thoughts about working with the code for each. Which are easier to work with, which seem to move faster.    Include the following functions when compiling the code:   // Prints out an array of length 'n'   // Takes an array and its length as arguments   void print_array(int *array, int n){   for(int i = 0; i < n; i++){   cout << array[i] << '\t';   }   cout << endl;   cout << endl;   }       // Prints a dividing line   void print_dividing_line(){   for(int i = 0; i < 72; i++){   cout << '-';   }   cout << endl;   }       // Prints two elements being swapped and the remaining vector   // on separate lines   // Takes an array, index of swapping elements, and array size   // as arguments   void print_swap(int…