- The Linear Search (Sequential Search) is the simplest algorithm to search a specific target key in a data collection. It simply examines each element in turn, starting with the first element, until it finds the target element or it reaches at the end of array. It is also the least efficient.
- The Binary Search is the standard method for searching through a sorted array. It is much more efficient than the linear search but it does require that the elements be in order.
- A further search method is HASHING. Hash data structures allow the storage and retrieval of data in an average time which does not depend at all on the collection size.
Hashing refers to the conversion of a column's primary key value to a database page number on which the row will be stored. Retrieval operations that specify the key column value use the same hashing algorithm and can locate the row directly. Hashing provides fast retrieval for data that contains a unique key value. For Conversion of a value to its Database / Array index number, a Hash Function is used.
For downloading the presentation, use the link
http://www.4shared.com/file/110403351/8e2623bf/Hashing.html
(For further detail and presentation, mail me)
