Start learning →

An algorithm that splits a problem in half, solves each half and combines results is called:

ADivide and compress
BDivide and conquer
CDivide and compare
DDivide and collect
Answer & Solution
Correct answer: B. Divide and conquer
1. Binary search and merge sort both work this way. 2. The problem is broken down recursively. 3. That strategy is divide and conquer. _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