func bubblesort(A)

	 for i <- 1 to n do 				1+n+(n-1)+n(

		 swaps <- 0					1

		 for j <- 0 to n-i do				1+n+(n-1)+n(
			 if A[j] > A[j+1] then			1+1+1+1

				 temp <- A[j]			1+1

				 A[j] <- A[j+1]		 	1+1+1

				 A[j+1] <- temp 		1+1

				 swaps <- swaps+1		1+1+1

		 if swaps = 0 then				1+1))

			 break

end func



1+n+n-1+n             n+n+n^2+n^2-n+n^2		16n

19n+3n^2

c = 22

n0 = 3n^2 < 22 * n^2

3n^2 = 22*n^2