@@ -44,13 +44,9 @@ There are two phases for the research project: [Design and analysis](#design-and
## Design and analysis
First, **motivate** the problem that you're solving. Why are you passionate about this problem? How does the problem and its solutions expand on concepts introduced in this course? Consider how our study of data structures and algorithms has been motivated by different kinds of analysis. Balanced search trees helped us improve asymptotic runtime bounds over (unbalanced) binary search trees. Binary heaps can share the same asymptotic runtime bounds as balanced search trees, but are often faster in experimental runtime. And we introduced affordance analysis as a tool for solving problems beyond sets, maps, and priority queues. How does your problem fit into the rest of the course?
First, **motivate** the problem that you're solving. Why are you passionate about this problem? How does the problem and its solutions expand on concepts introduced in this course? Consider how our study of data structures and algorithms has been motivated by different kinds of analysis. Balanced search trees helped us improve asymptotic runtime bounds over (unbalanced) binary search trees. Binary heaps can share the same asymptotic runtime bounds as balanced search trees, but are often faster in experimental runtime. And we introduced affordance analysis as a tool for solving problems beyond sets, maps, and priority queues. How does your problem fit into the rest of the course? 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.
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.
Select one of the following design and analysis themes. Each design and analysis theme introduces 3 algorithms: **discuss all 3 implementations**.
Select one of the following design and analysis themes. Each design and analysis theme introduces 3 algorithms: **discuss all 3 algorithms**.
