This preview shows page 1. Sign up to view the full content.
Unformatted text preview: choices for solution. A tree with n leaves must have depth at least log n . Thus, any search algorithm based on comparisons requires at least log n work in the worst case....
View
Full
Document
This note was uploaded on 12/27/2011 for the course MAP 2302 taught by Professor Bell,d during the Fall '08 term at UNF.
 Fall '08
 BELL,D

Click to edit the document details