Table of Contents
CMPS-012B: Introduction to Data Structures Lecture 12
Announcements
Binary Search
Search Range
Narrowing the Search Range
Forgetful Search Example - ‘d’
Forgetful Search Example - ‘e’
“Forgetful” Binary Search - Recursive Version
Tail Recursion Removal
Checking Equality
Comparison Tree - Sequential Search
Tree for Binary Search
Search Cost Using Search Trees
2-trees
|
Author: Mike Goss
Email: goss@cse.ucsc.edu
Home Page: http://www.cse.ucsc.edu/classes/cmps012b/Spring97
|