Description: Binary search algorithm idea is to sequence by ordering (ascending or descending) order, find the process using jump way to find that the first series to the middle point of order to compare objects to find the element value is less than if The midpoint of the element of unknown origin will be reduced for the left part of the sequence, otherwise the right half. Through a comparison, will look for half the interval narrowing. Binary search is an efficient search method. It can significantly reduce the number of comparisons to improve search efficiency. However, a prerequisite for binary search to find data in the table element must be ordered
To Search:
File list (Check if you may need any files):
折半查找.cpp
Download