Consider the following algorithm:

Bubble-sort(a)
for i = a.length() down to 1
for j = 1 to i-1
if a[j] > a[j+1]
swap(a[j], a[j+1]);
end if
end for
end for

What is its basic operation (write the line number of code which would define the execution time of the code)?