Bubble and insertion sort

What is the list 7, 3, 9, 2, 5 after the first pass of a bubble sort (ascending)?

What is the list 4, 1, 6, 3, 8, 2 after the first pass of a bubble sort (ascending)?

What is the list 9, 8, 7, 6 after the first pass of a bubble sort (ascending)?

Insertion sort runs on 5, 2, 8, 1, 9. What is the list once the items at indexes 1 and 2 have both been inserted?

Insertion sort runs on 3, 6, 1, 4. What is the list once the items at indexes 1 and 2 have both been inserted?

A bubble sort with no early stop runs n − 1 passes of n − 1 comparisons. How many comparisons for 6 items?

What is the worst-case time complexity of bubble sort?

Why is insertion sort fast on data that is already nearly sorted?

Bubble sort and insertion sort both sort in place. What does that mean?

Bubble sort

The procedure sorts an array into ascending order. It is called on 5, 3, 8, 4, 2.

procedure bubble(byRef a, n)    swapped = True    while swapped        swapped = False        for j = 0 to n - 2            if a[j] > a[j + 1] then                temp = a[j]                a[j] = a[j + 1]                a[j + 1] = temp                swapped = True            endif        next j    endwhileendprocedure