Bubble and Merge sort C++ please. I am stuck and my code is not working for these two

CSC326 group lab You need to implement insertion sort, selection sort, bubble sort, merge sort, and quicksort (increasing order) algorithms and measure the performance of these algorithms in terms of number of steps and CPU running time Task I Implement insertion sort, selection sort, bubble sort, merge sort, and quicksoet to sort the muambers in the increasing onder. Write the program to evaluate the performance of your algorithms in two ways: (1) CPU time; (2) total no. of steps Input: 1) the number of integers to be sorted,n 2) generating three instances as follows a. sorted input data set: 1,2,3, b. reversely sorted input data set: n, n-1, 32. c. random permutation of 1, 2.., n (randoem permutation means that each number of 1, 2.., . appears exactly once in the input data set but with random position. For example, ifa-5, then you may have the random pennutation 4, 1, 3, 5,2). Test your program and do the experiments as follows: Run the above three generated input data sets for each n (number of inmegers)- 100, 200, 300, 400, s00, 1000, 2000, 4000, 10000 Note: (1) You may have to repeat the algorithm many times, each time you need to initialize the array. (2) Your running time for each sorting algorithm should exclude the time for initialization. (3) All measurement should be done in a single run, Le. you do not need to run once for n 100, another time for n-200, etc