Decision trees can model comparison sorts. For a given algorithm:
- One tree for each n
- Tree paths are all possible execution traces
- Whatís the longest path in a decision tree for insertion sort? For merge sort?
What is the asymptotic height of any decision tree for sorting n elements?
Answer: ?(n lg n) (now letís prove itÖ)