Sorting Algorithms: Bubble and Merge

QuizÂ by GCSE AQA Computer Science

GCSE (AQA)

Computer Science

English National Curriculum

Feel free to use or edit a copy

includes Teacher and Student dashboards

### Measures 1 skill fromGCSE (AQA)Computer ScienceEnglish National Curriculum

Measures 1 skill from

GCSE (AQA)

Computer Science

English National Curriculum

3.1.4.a

Track each student's skills and progress in your Mastery dashboards

With a free account, teachers can

- edit the questions
- save a copy for later
- start a class game
- automatically assign follow-up activities based on studentsâ€™ scores
- assign as homework
- share a link with colleagues
- print as a bubble sheet

### Our **brand new** solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

12 questions

Show answers

- Q1Which algorithm iterates through a data set repeatedly, swapping values that are in the wrong order?BinaryMergeLinearBubble45s3.1.4.a
- Q2Using a bubble sort on the following list: 3, 17, 6, 5, 8. What will the list look like after the first pass?3,5,6,8,173,17,6,8,53,6,5,8,1717,8,6,5,345s3.1.4.a
- Q3Using a bubble sort on the following list: 3, 17, 6, 5, 8. What will the list look like after the second pass?17,8,6,5,33,5,6,8,173,5,6,8,173,17,6,8,545s3.1.4.a
- Q4How many passes would the following list (3,17,6,5,8) need to sort it using a bubble sort?OneTwoThreeFour45s3.1.4.a
- Q5Why do you need an additional pass through a list at the end of a bubble sort?You do not need a final passTo make the algorithm more complexAs a final validation checkTo make it look neater45s3.1.4.a
- Q6What is the first action in a merge sort?To compare the first two valuesTo compare the last two valuesTo split the items up into their own data setsTo split the data set at the middle value45s3.1.4.a
- Q7Which sorting algorithm needs to iterate through the list repeatedly?BinaryMergeBubbleLinear45s3.1.4.a
- Q8Which sorting algorithm splits a list of items into individual lists?LinearMergeBubbleBinary45s3.1.4.a
- Q9What sorting algorithm does this pseudocode represent?BubbleLinearBinaryMerge45s3.1.4.a
- Q10Which sorting algorithm uses the divide and conquer approach to sorting data sets?BubbleInsertionMergeNone of these45s3.1.4.a
- Q11What does a sorting algorithm do?Sorts data sets into alphabetical or numerical orderSearches data sets by comparing valuesWrites data items to an array or listSaves data items in an array or list45s3.1.4.a
- Q12How can a trace table help with sorting algorithms?All of theseIt can be used to keep track of where you have previously swapped valuesYou can use it to test the algorithm for logical errorsIt can be used to keep track of progression through the swaps or passes45s3.1.4.a