25: Algorithms

Question 1

What does a bubble sort do?

Answer 1

• orders an unordered list of items by comparing each item with the next one and swapping the items if they are out of order
• The algorithm is finished when no more swaps can be made
• very inefficient but easy to implement, good for small data sets

Question 2

What does an insertion sort do?

Answer 2

• inserts each item into its correct position in a data set one at a time - it is a useful algorithm for small data sets