untitled

What does a sorting algorithm do?

• Puts a list of elements into order

• Locates a specific element in a list of data

• Saves a set of data.

The process keeps repeating until there are no swaps in a pass.

• Bubble sort
• Insertion 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

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

• Bubble sort
• Insertion sort

Starts by looking at the second item and compares it to all items before it in order to insert it in the right place.

• Bubble sort
• Insertion sort

Good for small lists.

• Bubble sort
• Insertion sort
• Bubble sort and insertion sort

Does not cope well with very large lists.

• Bubble sort
• Insertion sort
• Bubble sort and insertion sort

Speed of sort depends on how unordered the list is.

• Bubble sort
• Insertion sort
• Bubble sort and insertion sort

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion