INDIVIDUAL ASSIGNMENT!

ESTIMATE THE TIME COMPLEXITY AND BIG$-$O NOTATION FOR THE FOLLOWING ALGORITHM! $(20$ Marks$)$

procedure insertion sort$($a$1,$ a$2,..,$ an: real numbers with $n2)$

for $j$:$=2$ to $n$

$i=1$

$\{$while aj $>$ ai

$i=i+1$

$m=aj$

$\{$for $k$:$=0$ to $j-i-1$

$aj-k=aj-k-1$

$ai=m$

$10.,$ an is in increasing order