Data Str & Algorithm HW Solutions 53

Data Str & Algorithm HW Solutions 53 - choices for...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
53 7.19 There are n possible choices for the position of a given element in the array. Any search algorithm based on comparisons can be modeled using a decision tree. The tree must have at least n leaf nodes, one for each of the possible
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online