SORTING ALGORITHMS

In all sorting exercises assumption is we are trying to sort from smallest to largest values.

$1.$ Determine the runtime using exact formula $($not using big$-$O notation$)($write down the formula first$)$ for each of the following cases:

a$)10000$ random data using Selection Sort

b$)$ For the $100$ data set given as:

$1,2,3,4,5,...,100$

Using Bubble Sort

c$)$ For $500$ data given in increasing order using Merge Sort.

d$)$ Given $50$ data in the descending order $($i$.$e$.$ a$0>$ a$1>$ a$2>....).$ Use Insertion sort to sort them.

e$)$ For N $=1000$ what would be the best case and what would be the worst case runtime using Quick Sort?