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

Takes each item in turn and puts it in the right place using the first item in the list as a starting point.

• Selection Sort

• Merge Sort

• Insertion Sort

• Bubble Sort

 

Which type of sort algorithm is this?

An algorithm is...

• A set of steps to follow in order

• When you search data for a specific entity

• When you sort data into the correct order

• Both A and C

True or False:

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

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

• To show we can do it

• So it looks nice

• It is easier to make sense of

Which algorithm would work best to sort data as it arrives, one piece at a time, perhaps from a network?

If you’re quite done with more complex sorting algorithms and want to move on to something simpler: _________ is the way to go.

Best Time Complexity of Insertion Sort

In every run, compare it with the predecessor. If the current element is not in the correct location, keep shifting the predecessor subarray till the correct index for the element is found.

• Merge Sort

• Insertion Sort

• Bubble Sort

• Selection Sort