1. Using the following code c++ please insert a merge sort

Q1. Apply Merge Sort and Quick Sort to the list, C , 0 , M , P, U,T,E,R in alphabetical order.

Which sort usually requires fewer data values to be swapped, bubble sort or selection sort?

Modify the recursive Fibonacci function to employ the memoization technique discussed in this chapter. The function creates a dictionary and then defines a nested recursive helper function named memoizedFib. You will need to create a dictionary to cache the sum of the fib function. The base case of the fib function is the same as before. However, before making any recursive calls, the helper function looks up the value for the function’s current argument in the dictionary (use the method get, with None as the default value). If the value exists, the function returns it and skips any recursive calls. Otherwise, after the helper function adds the results of its two recursive calls, it saves the sum in the dictionary with the current argument of the function as the key. Note: The program should output in the following format: n      fib(n) 2       1 4       3 8       21 16      987 32      2178309 ---------------------------------------------------------------------------------- def…

Output the execution time for the quick sort, selection sort, insertion sort, bubble sort, and merge sort algorithms as they attempt to sort an array of 1000 random numbers, 1000 sorted number, and 1000 numbers in reversed order. For this use the the high_resolution_clock::now() function that will return the current time. To use this you will also need to include the header file as well as using namespace std::chrono. Quick sort 187 ms for random numbers 176 ms for sorted numbers 173 ms for reversed numbers Selection sort 1300 ms for random numbers 1424 ms for sorted numbers 2578 ms for reversed numbers Insertion sort 401 ms for random numbers 1 ms for sorted numbers 1 ms for reversed numbers Bubble sort 1366 ms for random numbers 669 ms for sorted numbers 667 ms for reversed numbers Merge sort 1297 ms for random numbers 1049 ms for sorted numbers 1010 ms for reversed numbers

Language: C++  Write a Program with Comments for your code to improve quick sort. The quick sort algorithm presented in the ClassNotes-Sorting selects the first element in the list as the pivot. Revise it by selecting the median among the first, middle, and last elements in the list. Code to be revised: #include <iostream>using namespace std; // Function prototypesvoid quickSort(int list[], int arraySize);void quickSort(int list[], int first, int last);int partition(int list[], int first, int last); void quickSort(int list[], int arraySize){quickSort(list, 0, arraySize - 1);} void quickSort(int list[], int first, int last){if (last > first){int pivotIndex = partition(list, first, last);quickSort(list, first, pivotIndex - 1);quickSort(list, pivotIndex + 1, last);}} // Partition the array list[first..last]int partition(int list[], int first, int last){int pivot = list[first]; // Choose the first element as the pivotint low = first + 1; // Index for forward searchint high = last;…

Define a sort function as below void sort(struct Employee * base], int n, int (*compareFunc)(struct Employee ** struct Employee **)) { qsort((void **)base,n,sizeof(void *),(int (*)(const void *,const void *))compareFunc); } Q1) What does the line in the provided sort function do? Describe each of the 4 arguments being passed to qsort. What do we need that big strange cast for the fourth argument?

Do this using C++ language using structures and singly linked list.

Language: C++  Write a Program with Comments for your code to improve quick sort. The quick sort algorithm presented in the ClassNotes-Sorting, it selects the first element in the list as the pivot. Revise it by selecting the median among the first, middle, and last elements in the list.Explain your Outputs or Answers for the following: (C)  Give a list of n items (for example, an array of 10 integers) representing the worst-case scenario. (D)  Give a list of n items (for example, an array of 10 integers) representing the best-case scenario. Please compile your answers in a file including all source code with comments, Explain your running Outputs or Answers in (A) ~(D). Quicksort that was mentioned in the ClassNotes: #include <iostream>using namespace std; // Function prototypesvoid quickSort(int list[], int arraySize);void quickSort(int list[], int first, int last);int partition(int list[], int first, int last); void quickSort(int list[], int arraySize){quickSort(list, 0,…

C++