Find the time complexity of the given code:

Question

For i=1 to n-1

For j=0 to n-i-1

If a[j] > a[j+1] then

Set temp=a[j]

Set a[j]=a[j+1]

Set a[j+1]= temp

Answer 1

order O(n^2)

For i=1 to n-1 <-- n

For j=0 to n-i-1 <-- n/2 on average

n(n/2) = n^2/2 so order O(n^2)