Merge sort
Computer Science · Algorithms
Loading practice question…
About this practice set
Merge sort is part of Computer Science (Algorithms). Questions are generated with new numbers each time you practise. Levels available: Easy. After you answer, an explanation is shown.
Example questions
A taste of what you will practise. Answers are revealed after you try.
Easy
What strategy does merge sort use?
- Divide and conquer
- Brute force
- Randomisation
- Linear scanning