I did the analysis for quick sort already and need help with selection sort and insertion sort.

A little paragraph for each would be fine. Thanks

You can also fix quick sort if I did it wrong or missed something

C++

Please analyze the time it took for each algorithm to sort the values. Please explain why the performance differs based upon the nature of the data. Please give thorough answers based upon the syntax of the algorithm and how that impacts the time each algorithm takes to complete the sorting task. Random Mostly Sorted Mostly Sorted Selection Insertion Quicksort 1.5 ms 0.96 0.22 ms Descending 1.5 ms 1.7 ms 5.3 ms Ascending 1.45 ms 0.15 ms 2.5 ms Quick sort (where pivot is chosen as a cormer element), the worst occurs when the input array is already sorted (descending and ascending cases ) and the best occur when the pivot elements always divide array in two halves. For selection and insertion sort, the worst case occurs when the array is reverse sorted and the best case occurs when the array is sorted in the same order as output