GCSE J277 - 2.1.3 - Sorting Algorithms

Which of the following is not a sorting algorithm

• Bubble
• Insertion
• Binary
• Merge

Goes through a list repeatedly, swapping elements in the wrong order

• Merge
• Bubble
• Insertion
• None of the above

Splits list into individual lists, combining them back together in order 2 at a time

• Merge
• Bubble
• Insertion
• None of the above

Take each item in turn, compare to the items in the sorted list and place in the correct order

• Merge
• Bubble
• Insertion
• None of the above

First action is to mark the first item as the ordered list

• Merge
• Bubble
• Insertion
• None of the above

Which algorithm needs to go through a list multiple times

• Merge
• Bubble
• Insertion
• None of the above

Which one splits a list into individual lists

• Merge
• Bubble
• Insertion
• None of the above

What is the purpose of a sorting algorithm

• Find an item in a dataset
• Save an item in a dataset
• Order items in a dataset
• Remove an item in a dataset

What does ascending mean

• Lowest to Highest
• Highest to Lowest

What does descending mean

• Lowest to Highest
• Highest to Lowest