notes

Personal notes
git clone git://git.laack.co/notes.git
Log | Files | Refs

DivideAndConquer.md (354B)

      1 # Divide And Conquer
      2 
      3 CLRS 2.3.1
      4 
      5 **Definition:** Divide and conquer algorithms are algorithms that break a problem down into smaller sub-problems and then solve each subproblem.
      6 
      7 This algorithms are often, but not always, recursive.
      8 
      9 Steps:
     10 
     11 1. (Divide) Divide problem into subproblems
     12 2. (Conquer) Solve subproblems
     13 3. (Combine) Aggregate final result