What is the Time Complexity of this Sorting Algorithm on an Array?

[darkvalentine]

Homework Statement

Compute the time complexity of the following sorting algorithm on an array L[0..n-1] in terms of n. Basic Operation only includes comparison and swap.
sort (L, n)
{
int i=0, j;
while(i<n-1){
s = i ;
j=i+1;
while(j<n){
if (L[j]<L) s = j;
j++;
}
swap (L,L);
i++;
}
}

Homework Equations

N/A

The Attempt at a Solution

Well, we have just studied about the big O notation last week, but I have no idea how we apply it to solve this kind of problem.

 

[╔(σ_σ)╝]

It looks to me like n^2 because of the nested loops.

 

[darkvalentine]

It looks to me like n^2 because of the nested loops.

Thank you, I think it x² because of 2 loops, and each loop is executed n times.

 

[╔(σ_σ)╝]

Yes n^2. The inner loop has a worst case of n and the outter loop also runs n times.