In the posted pseudocode for bubblesort how many times is the code aj > aj+1 executed when n = 30?

code:

procedure bubblesort: a₁, ... ,a_n: real numbers

for i:= n down to 2

for j:= 1 to i-1

if a_j > a_j+1

temp:= a_j

a_j := a_j+1

a_j+1 := temp

{ a₁, .... , a_n will be sorted in ascending order }