Sorting Algorithms

Question 1

What is Bubble Sort?

Answer 1

compares two items at a time and swaps them if they are in the wrong order. It repeats this until the whole list is sorted It goes through the list many times, each time moving the biggest unsorted item to the end

Question 2

What is Merge Sort?

Answer 2

It keeps splitting the list in half until each piece has one item, then puts the pieces back together in the right order.

Question 3

What is Insertion Sort?

Answer 3

Insertion Sort builds a sorted list one item at a time by inserting each new item into the right place.

Question 4

Which is the fastest

Answer 4

Merge Sort is usually the fastest because it splits the list and works on parts at the same time.

Question 5

Which sorting algorithm is the simplest?

Answer 5

Bubble Sort is the simplest to understand, but it’s also the slowest for large lists.

Question 6

When is Insertion Sort useful?

Answer 6

Insertion Sort is good for small lists or when the list is almost sorted already.