Bubble Sort And Insertion Sort

Question 1

How does a bubble sort work?

Answer 1

Bubble up the smallest (or largest) item to the end of the list, then the second smallest, then the third smallest and so on until no more swaps are needed

Question 2

How does an insertion sort work?

Answer 2

The algorithm takes one data item from the list and places it in the current location in the new list