Binary Search - this method is used for searching in sorted data sets. It works by selecting the middle element of the data set, essentially the median value, and comparing it to the target value. If the values match, it returns true. If the target value is higher than the probe element's value, it takes the upper half of the data set and performs the same operation with it. Likewise, if the target value is lower than the probe element's value, it performs the operation with the lower half. It continues to halve the data set with each iteration until the value is found or it can no longer divide the data set.

<< Prev | 9/11 | Next >>
English
Home