Prove that this algorithm is correct $($i$.$e$.$ that it actually sorts the inputarray$)$ and give an asymptotically tight bound on the algorithms runtime$($using big$-\backslash$Theta notation$)$