next up previous
Next: Analysis Of Decision Tree Up: l4 Previous: Lower Bounds For Worst-Case

Decision Tree Model

n = 3

Input: $<$a1,a2,a3$>$

Number of possible outputs = 3! = 6

Each output must appear in leaves

Thus, number of leaves $\geq$ 6



\psfig{figure=figures/f4-1.ps,width=3in,height=3in}


next up previous
Next: Analysis Of Decision Tree Up: l4 Previous: Lower Bounds For Worst-Case