|
binary search| In computing, rapid technique used to find any particular record in a list of records held in sequential order. The computer is programmed to compare the record sought with the record in the middle of the ordered list. This being done, the computer discards the half of the list in which the record does not appear, thereby reducing the number of records left to search by half. This process of selecting the middle record and discarding the unwanted half of the list is repeated until the required record is found. |
How to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit webmaster's page for free fun content. |
?Sign in  |
|---|
|
|
|