binary search algorithm
binary search algorithm (logarithmic search algorithm; bisection algorithm) A searching algorithm that uses a file in which the sortkeys are in ascending order. The middle key in the file is examined and, depending upon whether this is less than or greater than the desired key, the top or bottom part of the file is again examined. Continuing in this way the algorithm either finds the desired record or discovers its absence from the file. Thus the algorithm treats the file as though it were a binary search tree.
More From encyclopedia.com
Searching , searching Locating information in a table or file by reference to a special field of each record, called the key. The goal of the search is to discov… File , file1 / fīl/ • n. a folder or box for holding loose papers that are typically arranged in a particular order for easy reference: a file of correspond… Search , search / sərch/ • v. [intr.] try to find something by looking or otherwise seeking carefully and thoroughly: I searched among the rocks, but there wa… Acrobat , acrobat •at, bat, brat, cat, chat, cravat, drat, expat, fat, flat, frat, gat, gnat, hat, hereat, high-hat, howzat, lat, mat, matt, matte, Montserrat,… Wildcards , Wildcards are symbols that can be used to represent other values or characters during a search for files or other information on a computer system. T… Ftp , File transfer protocol (FTP) is an Internet-standard application for transferring files. FTP was first developed in 1971 as part of the U.S. Departme…
You Might Also Like
NEARBY TERMS
binary search algorithm