Bubble Sorts

What would be the order of this list after 1 pass of a bubble sort? 5, 2, 18, 7, 6, 9

• 2, 5, 6, 7, 9, 18

• 2, 5, 7, 6, 9, 18

• 18, 9, 7, 6, 5, 2

• 5, 2, 7, 6, 18, 9

What does a sorting algorithm do?

• Finds an item of data in a set of data

• Saves a set of data

• Puts a list of items into order

• Copies a list of items

Which of the following is not a sorting algorithm?

• Bubble Sort

• Long Sort

• Insertion Sort

• Merge Sort

How does a bubble sort work?

• It sorts a list by comparing neighbouring items to see which is out of order

• It finds an item of data in a list

• It takes one item from the list and places it in the correct place

• It divides the list into sublists and then merges pairs of sublists together to sort the data.

How many passes will a bubble sort go through?

• One

• Two

• The amount of passes is the same as the length of the list

• Several passes - until the entire list is sorted

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

• To put the data back into a list

• Because it doesn't recognise that the list is in order until it completes a final pass with no swaps

• To save the list

• To double check in case of mistakes

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

• It takes a very long time to run

• It's simple to implement

• It's very quick

• There is no advantage of a bubble sort

How many passes would be needed to sort the following list?

7, 3, 9, 5, 12, 1, 2

• 5

• 6

• 1

• 3