Bubble Sort

Compares pairs of items and swaps them if they are in the wrong order. Each pair in the list is checked.

• Bubble sort
• Insertion sort

Inefficient way to sort a list.

• Bubble sort
• Insertion sort

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion

A bubble sort goes through each pair in a list and swaps them if not in order.

• True
• False

What does a bubble sort do?

• Sorts a list by comparing two items that are side by side, to see which is out of order
• Separates a list of data into different collections of data, before sorting and gathering back into a list
• Finds an item of data in a list

Why does a bubble sort do a final pass even when the data is in the correct order?

• To save the data
• It does not recognise that the data is in order until the final pass requires no changes
  
• It needs to do this to put the data back in to a list
  

Which of the following is an advantage of a bubble sort?

• It is a very small and simple computer program
  
• It takes a very long time to run
• It is very quick
  

Which sorting algorithm may make multiple swaps per pass?

• Bubble Sort

• Selection Sort

• Insertion Sort

• Merge Sort

What does a sorting algorithm do?

• Puts numbers in order

• Puts data in order

• Finds a bit of data

How many passes are required to sort a list with 5 elements?

• 5

• 4

• 10

• 2