Software Engineering KB

Home

❯

01 Foundations

❯

01 Algorithms

❯

01 Concept

❯

Divide and Conquer

Divide and Conquer

Feb 10, 20261 min read

  • algorithms
  • divide-and-conquer

Divide and Conquer

← Back to Backtracking & Recursion

An algorithm design paradigm that breaks a problem into smaller independent subproblems, solves each recursively, and combines results. Many fundamental algorithms follow this pattern.

Key Properties

  • Merge Sort (D&C)
  • Quick Sort (D&C)
  • Closest Pair of Points
  • Strassen’s Matrix Multiplication

Related

  • Backtracking (related recursive technique)

algorithms divide-and-conquer


Graph View

  • Divide and Conquer
  • Key Properties
  • Related

Backlinks

  • Backtracking & Recursion
  • Backtracking
  • Recursion Patterns
  • Closest Pair of Points
  • Merge Sort (D&C)
  • Quick Sort (D&C)
  • Strassen's Matrix Multiplication

Created with Quartz v4.5.2 © 2026

  • GitHub