Bubble sort

Question 1

What is a sorting algorithm?

Answer 1

• An algorithm that arranges data into order

Question 2

What orders are sorting algorithms usually used for?

Answer 2

• Ascending
• Descending

Question 3

What three sorting algorithms should you know?

Answer 3

• Bubble sort
• Merge sort
• Insertion sort

Question 4

How does bubble sort work?

Answer 4

• Compare adjacent items
• Swap if they are in the wrong order
• Repeat passes until no swaps are needed

Question 5

What happens in each pass of a bubble sort?

Answer 5

• Adjacent items are compared
• Swaps are made if needed
• The largest unsorted item moves towards the end

Question 6

Why are fewer comparisons needed in later passes of bubble sort?

Answer 6

• The largest values have already moved to the end

Question 7

When does bubble sort stop?

Answer 7

• When a full pass makes no swaps

Question 8

What are the advantages of bubble sort?

Answer 8

• Easy to understand
• Easy to implement

Question 9

What are the disadvantages of bubble sort?

Answer 9

• Slow on large lists
• Slow on reverse-ordered lists