Question

time complexity of bubble sort?.............don't spam​

Answer 1

Step-by-step explanation:

The bubble sort algorithm is as follows:

Compare A[0]A[0] and A[1]A[1]. If A[0]A[0] is bigger than A[1]A[1], swap the elements.

Move to the next element, A[1]A[1] (which might now contain the result of a swap from the previous step), and compare it with A[2]A[2]. If A[1]A[1] is bigger than A[2]A[2], swap the elements. Do this for every pair of elements until the end of the list.

Do steps 1 and 2 nn times

Answer 2

Step-by-step explanation:

i cant use brainly now...agr apko lag raha ki mei jhoot bol.raha hu...apke koi genius rank wale frnds se puchlo mera active seen ......