Description: Set a [1: n] is already sorted array. Please rewrite the binary search algorithm, so when the search for element x is not in the array, the return is less than x is greater than the largest element in the location and position of the minimum element of x j. When the search element in the array when, i and j is the same, x position in the array.
To Search:
File list (Check if you may need any files):
2fen\2fen\2fen.cpp
....\....\2fen.vcproj
....\....\2fen.vcproj.WHT.wanghongtao.user
....\....\Debug\2fen.exe.embed.manifest
....\....\.....\2fen.exe.embed.manifest.res
....\....\.....\2fen.exe.intermediate.manifest
....\....\.....\2fen.obj
....\....\.....\2fen.pch
....\....\.....\BuildLog.htm
....\....\.....\mt.dep
....\....\.....\stdafx.obj
....\....\.....\vc90.idb
....\....\.....\vc90.pdb
....\....\ReadMe.txt
....\....\stdafx.cpp
....\....\stdafx.h
....\....\targetver.h
....\2fen.ncb
....\2fen.sln
....\2fen.suo
....\Debug\2fen.exe
....\.....\2fen.ilk
....\.....\2fen.pdb
....\2fen\Debug
....\2fen
....\Debug
2fen
Download