I need a detailed analysis of bubblesort in the style of the example insertsort because i don't understand why my analysis is wrong.

= BUBBLESORT(A) 1 for i 1 to A.length 1 2 A.length downto i +1 3 if A[j] 0 and A[i] > key 6 A[i + 1] = A[i] 7 i = i - 1 8 A[i + 1] = key C4 n - 1 C5 C6 {j=2t; =2(t; 1) =2(t; 1) n C7 C8 n - 1