Divide and Conquer

Merge sort as the template, counting inversions, closest pair, and Karatsuba.

0 / 3 solved

Question Tags Difficulty Success

1. Thirteen In Four Squarings

divide-and-conquerbinary-exponentiation +2

Medium —

2. How Many At Once

divide-and-conquermerge-sort +2

Medium —

3. The Half That Never Shrinks

divide-and-conquerdebugging +2

Medium —

Learning Resources

MIT 6.046 Lecture 2, Divide and conquer: convex hull, median finding

Jeff Erickson, Recursion chapter

cp-algorithms, Divide and conquer DP

Up next

3 of 3 questions here are still unsolved.

Next module Dynamic Programming: States & Transitions