No Code Computer Science
  • No Code Computer Science
  • Data Structures
    • Primitive
    • Array
    • Dictionary (Hash Map) (Hash Table)
    • Linked List
    • Tree
    • Network (Graph)
  • Algorithms
    • Big O Notation
    • Brute Force
    • Greedy
    • Divide & Conquer
    • Sort
    • Search
Powered by GitBook
On this page
  • What is a Divide & Conquer Algorithm?
  • Building a House

Was this helpful?

  1. Algorithms

Divide & Conquer

A Divide & Conquer Algorithm converts a big problem to small problems

PreviousGreedyNextSort

Last updated 4 years ago

Was this helpful?

What is a Divide & Conquer Algorithm?

A Divide & Conquer Algorithm divides a big problem into small problems and solves the smaller problems.

  1. Design

  2. Foundation

  3. Framing

  4. Plumbing, Electrical, HVAC

  5. Insulate

  6. Drywall

  7. Flooring & Countertops

  8. Trim, Doors & Fixtures

  1. Architect

  2. Contractor

  3. Carpenter

  4. Plumbers

  5. Electricians

  6. Roofers

  7. General Laborer

Building a House

A Divide & Conquer Algorithm divides building a house into smaller subproblems.

A construction site would break these subproblems into different careers to solve each problem.

Divide & Conquer is one of the most useful and common problem solving skills

🏡
👷
👷‍♀️
🏗️
🏗️
🕵️‍♀️
🕵️‍♀️
➗
⚔️