@@ -48,7 +48,7 @@ First, **motivate** the problem that you're solving. Why are you passionate abou
Then, describe the **design** of each data structure and algorithm in enough detail to teach it to another student.
Finally, give an **asymptotic analysis** for each implementation and describe your assumptions to provide the best understanding to the reader. If the application for the data structure cannot be described as a type of set, map, or priority queue, give an **affordance analysis** toward a real-world problem.
Finally, give an **asymptotic analysis** for each implementation and describe your assumptions to provide the best understanding to the reader.
Select one of the following design and analysis themes. Each design and analysis theme introduces 3 algorithms: **discuss all 3 implementations**.
