Description: This question is divide and conquer algorithm binary search is for an ordered array, the array of divide and rule, the same as the original input is divided into two sub-problems, if the scale is too large, we do the above for these sub-problems processed until these sub-problems easier to solve so far. This algorithm is a very efficient algorithm, each time through the loop, it can reduce the size of the array to the original and a half, its space complexity is O (log (n)) times.
To Search:
File list (Check if you may need any files):
suanfa3\Debug\vc60.idb
.......\.....\vc60.pdb
.......\.....\w.exe
.......\.....\w.ilk
.......\.....\w.obj
.......\.....\w.pch
.......\.....\w.pdb
.......\w.cpp
.......\w.dsp
.......\w.dsw
.......\w.ncb
.......\w.opt
.......\w.plg
.......\Debug
suanfa3
Download