Merge Sort (OCR A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
11 questions from this quiz
ShowHide
Practise the questions
11 questions from this quiz
What approach does Merge Sort use?
What approach does Merge Sort use?
Divide-and-conquer
What is the time complexity of Merge Sort in the worst case?
What is the time complexity of Merge Sort in the worst case?
What is the space complexity of Merge Sort?
What is the space complexity of Merge Sort?
What does it mean that Merge Sort is stable?
What does it mean that Merge Sort is stable?
It maintains order of equal elements
What are the three main steps of Merge Sort?
What are the three main steps of Merge Sort?
Divide, Conquer, Merge
What condition stops the recursion in Merge Sort?
What condition stops the recursion in Merge Sort?
Array length is 1 or less
In the Merge method, what are the three indices used?
In the Merge method, what are the three indices used?
, ,
During merging, which element is placed in the merged array first?
During merging, which element is placed in the merged array first?
The smaller element
What common mistake involves elements after one subarray is exhausted?
What common mistake involves elements after one subarray is exhausted?
Not copying remaining elements
What type of datasets is Merge Sort particularly effective for?
What type of datasets is Merge Sort particularly effective for?
Large datasets
How is the midpoint calculated when splitting the array?
How is the midpoint calculated when splitting the array?
array.length DIV 2