Assignment $2$

Perform complexity analysis on either Quick Sort or Insertion Sort by doing the following:

i$.$ Describe the algorithm with an example.

ii$.$ Calculate the time complexity of the algorithm.

iii. What is the Big O$(?)$ of this algorithm?

iv$.$ Which class of the complexity does it belongs.