Explain:

Simple Sort

This algorithm sorts the elements of an array.

Input: numb, an array of $n$ integers

Output: numb, in ascending order

for $i=1$ to $n$

for $j=1$ to $n-i$

if numb$($j$)>$ numb$($j$+1)$

temp $=$

$umb(j)$

$umb(j)=$

$umb(j+1)$

numb $(j+1)=$ temp

end for

end for

What is the asymptotic worst$-$case complexity?

Less

$O(1)$

$O(n)$

$O(n^2)$

$O(nlog(n))$