Start learning →

The canonical divide and conquer comparison sorting algorithm is:

AMerge search
BMerge shift
CMerge sort
DMerge scan
Answer & Solution
Correct answer: C. Merge sort
1. It splits the list, sorts each half and merges. 2. It makes two recursive calls each time. 3. That algorithm is merge sort. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Practise this question with Quill — Coding Interview Prep →

Keep practising Data Structures and Algorithms

Browse all Data Structures and Algorithms questions for Coding Interview Prep, or explore more Computer Science topics.

Start a Data Structures and Algorithms lesson →
Related questions
Algorithms bingoType the numberSort the computing ideasArray or linkedSlice the structuresRun the algorithm gatesPop the growth classesCatch the data structures