Ajairajv/design-and-analysis-of-algorithms ? reverse-engineered prompt

I want you to turn this into a full set of study notes for my Design and Analysis of Algorithms course.

Use the existing Unit 1 file as the style guide, and build out the missing unit files so they feel consistent, clear, and easy to revise from. Keep it in simple Markdown, with each unit covering the theory in plain language, worked examples, proofs where needed, step by step traces, and a set of solved practice questions plus a short revision sheet at the end.

Please cover the remaining topics from the README, especially string matching and computational geometry, dynamic programming, graph algorithms and greedy methods, transform and conquer, advanced techniques, backtracking, branch and bound, and complexity classes. Make sure the explanations are detailed enough for exam prep, but still readable for someone learning the subject on their own.

If you need to check current terminology or standard examples, look up the latest reference material online first.