Date: January 7 2021
Summary: The divide and conquer design paradigm to break down a problem to smaller parts and rebuild it to a solution
Keywords: ##zettel #computer #science #algorithm #design #divide #conquer #archive
"Divide-and-Conquer": an algorithm design paradigm comprised of three steps
Break a problem into smaller subproblems
Recursively evaluate subproblems
Combine subproblem solutions to one solution for the original problem.
One example of this paradigm is Merge Sort.
Zelko, Jacob. Divide and Conquer Algorithmic Design. https://jacobzelko.com/01072021062203-divide-conquer. January 7 2021.
 T. Roughgarden, Algorithms illuminated. Part 1: The Basics. San Francisco, CA: Soundlikeyourself Publishing, 2017.