Searching (cont)
Searching is a very important/frequent operation.
Many approaches have been developed to do it ...
- O(n) ... linear scan (search technique of last resort)
- O(logn) ... binary search, search trees (trees also have other uses)
- O(1) ... hash tables (only O(1) under optimal conditions)
We look at trees and hash tables in this part of course.
|
![[prev]](icon/prev.gif){kind=icon}
![[index]](icon/up.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}