StarMirror/cpp-interview
1
0
Fork 0
mirror of https://github.com/huihut/interview.git synced 2024-03-22 13:10:48 +08:00
Code Issues Projects Releases Wiki Activity

Merge pull request #50 from shoaibrayeen/patch-1

Browse Source 
Converting BS in Standard Form
This commit is contained in:
huihut 2019-09-07 21:12:33 +08:00 committed by GitHub
commit 69d735735d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
Algorithm/BinarySearch.h
View File

@ -1,22 +1,22 @@
// 二分查找（折半查找）：对于已排序，若无序，需要先排序 // 二分查找（折半查找）：对于已排序，若无序，需要先排序
// 非递归 // 非递归
int BinarySearch(vector<int> v, int value)
{
if (v.size() <= 0)
return -1;
int low = 0; int BinarySearch(vector<int> v, int value , int low, int high) {
int high = v.size() - 1; if (v.size() <= 0) {
while (low <= high) return -1;
{ }
while (low <= high) {
int mid = low + (high - low) / 2; int mid = low + (high - low) / 2;
if (v[mid] == value) if (v[mid] == value) {
return mid; return mid;
else if (v[mid] > value) }
else if (v[mid] > value) {
high = mid - 1; high = mid - 1;
else }
else {
low = mid + 1; low = mid + 1;
}
} }
return -1; return -1;
@ -34,4 +34,4 @@ int BinarySearch2(vector<int> v, int value, int low, int high)
return BinarySearch2(v, value, low, mid - 1); return BinarySearch2(v, value, low, mid - 1);
else else
return BinarySearch2(v, value, mid + 1, high); return BinarySearch2(v, value, mid + 1, high);
} }