Sequential and Binary Search

Seminar date: February 9

HW: JM Ch 14 5-10, pgs 405-406

Objective-Lab: Keeping Things in Order

1. Sequential (“Big O”) searches are done when an array is not in sequential order.
   1. Time-complexity-analysis
2. Binary (“O(log n)) searches are more efficient when the array is in sequential order.
   1. Cool examples
   2. Terminate or hang?