Quiz
Merge Sort Questionnaire
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (7)
1What is the first step a merge sort takes when executing a sort?

- ASplits the array in half.
- BMerge all elements in the array.
- COrders it all in ascending order.
- DSplits all elements in an array.
2A merge sort can only be done if all items are in ascending or descending order.
- ATrue
- BFalse
3After a split, what happens when the algorithm merges them together?

- AIt merges them all at once in the correct order.
- BIt merges them all individually.
- CIt merges them all individually, then adds the pairs together and continues merging.
- DIt splits them in reverse, adding them back up without sorting.
4Which of these is NOT an advantage of Merge Sort.
- AMuch more efficient than a bubble sort.
- BUses up more memory.
- CConsistent run time regardless of how ordered the items in the list are.
5Which of these are NOT a disadvantage of Merge Sort?
- AEven if the list is already sorted, it still goes through the whole splitting and merging process.
- BIt is slower than other algorithms with small lists.
- CQuicker than bubble sort in general.
6Which programming languages are optimal for a Merge Sort?
- AJava
- BPython
- CC++
- DPerl
- EScala
- FSQL
7True or false, it is easier to merge two ordered lists than two unordered lists.
- ATrue
- BFalse
Information
- Description
- Year 7 Computing Quiz on Merge Sort Questionnaire , created by Cole Sutton on 21/01/2022.
- Author
- Cole Sutton
- Language
- English
- Views
- 5
- Tags
- Rating
- No ratings yet Rate this quiz