CSE 2217 · Fall 2026
Data Structure and Algorithms II
Advanced data structures and algorithm design.
Mid-term questions
3
Simulations
6
- RecursionSee the call stack grow and unwind. Run
- Growth Rates of FunctionsCompare how fast common functions grow. Run
- Finding Min and MaxDivide and conquer: fewer comparisons. Run
- Maximum SubarrayBest sum in the left, right, or across the middle. Run
- Merge SortSplit, then merge sorted halves. Run
- Quick SortPartition around a pivot, then recurse. Run