Sorting Algorithm

Multiple Select

Which of these statements best describes the process of sorting

• Finding a particular item in a list of data

• Organising data into files

• Putting data items into a specific order

• To help decide what items should go in the recycle bin

Multiple Choice

What does the term 'adjacent' mean?

• Items of data that are next to each other

• Items of data that opposite each other

• Items of data that are the same

• Items of data that are at the beginning of a list

Open Ended

Two types of Sorting algorithms

Multiple Choice

This image shows the work of

• Insertion Sort

• Bubble Sort

Multiple Choice

Insertion Sort is considerably faster than the bubble sort for a smaller number of data

• True

• False

• Not Sure

Open Ended

Give examples of when insertion sort proves to be more efficient than bubble sort

Open Ended

Give Factors that may affect performance of sorting algorithm

Multiple Choice

Which statement best describes Bubble sort

• is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order

• a set of instructions for solving a problem or accomplishing a task.

• a method for reorganizing a large number of items into a specific order

• An algorithm that separates a list of data into different data collections. Each data collection is sorted and then gathered back into a list

Multiple Choice

What would be in the last position after the first pass of a bubble sort if we were to sort in descending order

• Henderson

• Pickford

• Kane

• Foden

• Saka

Poll

What would in the last position after the first pass of a bubble sort if we were to sort in ascending order

• 101

• 110

• 111

• 1

• 10

Multiple Choice

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

Multiple Choice

Inefficient way to sort a list.

• Bubble Sort

• Insertion Sort