Loading video...
Algorithms: Searching
- Searching is looking for a particular value in a collection
- If the collection is not sorted, every value must potentially be searched
- If the collection is sorted, it is possible to search much more efficiently
- Sequential Search examines every value; must be used if collection is not sorted
- Binary Search is much faster than Sequential Search for large collections of data but can only be used if the data is sorted
- Binary Search can be implemented either iteratively or recursively
Algorithms: Searching
Lecture Slides are screen-captured images of important points in the lecture. Students can download and print out these lecture slide images to do practice problems as well as take notes while watching the lecture.


































Start Learning Now
Our free lessons will get you started (Flash® 10 required).
Sign up for Educator.comGet immediate access to our entire library.
Features Overview