- Category:
- MPI
- Tags:
-
- File Size:
- 36kb
- Update:
- 2018-01-03
- Downloads:
- 0 Times
- Uploaded by:
- 金韫玉
Description: The method of binary search is one of the most efficient methods. Hypothesis has already ranked in accordance with the order of the growing up five integers a0 ~ a4, to find the number is X, its basic idea is: the scope of the data set to find the lower limit for l = 1, up to h = 5, strives for the midpoint m = (l + h) / 2, with X compared with neutral element am, if X is equal to the am, is found, stop looking for; Otherwise, if X is greater than am, replace the lower bound l=m+ 1, and continue to find it in the lower half; If X is less than am, change the upper limit h is equal to m minus 1, and continue to find it in the first half; Repeat the previous process until you find or l> h. If l> h, you don't have this number, print can't find the information, the program ends.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 折半查找法.cpp | 1092 | 2016-10-29
|
| 折半查找法.exe | 106190 | 2016-10-29 |
Download