Sorting Algorithms – Bubble and Merge (AQA A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
What does ascending order mean when sorting data?
What does ascending order mean when sorting data?
Arranging from smallest to largest
Why is bubble sort named 'bubble sort'?
Why is bubble sort named 'bubble sort'?
Larger values bubble up to one end
What happens after one complete pass of bubble sort?
What happens after one complete pass of bubble sort?
Largest value moves to correct position
What is the purpose of CompletedFlag in optimised bubble sort?
What is the purpose of CompletedFlag in optimised bubble sort?
Track if swaps occurred to stop early
How does bubble sort use memory compared to the original array?
How does bubble sort use memory compared to the original array?
Works in place with no extra memory
What strategy does merge sort use?
What strategy does merge sort use?
Divide and conquer
Why is a single-element list considered sorted in merge sort?
Why is a single-element list considered sorted in merge sort?
It's sorted by definition
What memory requirement does merge sort have?
What memory requirement does merge sort have?
Extra space for intermediate lists
Which algorithm is more efficient for large datasets?
Which algorithm is more efficient for large datasets?
Merge sort due to fewer comparisons
What programming technique does merge sort use?
What programming technique does merge sort use?
Recursion where subroutine calls itself