binry search for cpp code example
Example 1: c++ binary search
#include <algorithm>
#include <vector>
bool binarySearchVector(const std::vector<int>& vector,
int target) {
return std::binary_search(vector.cbegin(), vector.cend(), target);
}
#include <iostream>
int main()
{
std::vector<int> haystack {1, 3, 4, 5, 9};
std::vector<int> needles {1, 2, 3};
for (auto needle : needles) {
std::cout << "Searching for " << needle << std::endl;
if (binarySearchVector(haystack, needle)) {
std::cout << "Found " << needle << std::endl;
} else {
std::cout << "no dice!" << std::endl;
}
}
}
Example 2: c++ binary search
int result = -1;
int low = 0;
int high = N-1;
while (low <= high)
{ mid = (low + high) / 2;
if ( item == vector[mid])
{ result = mid;
break;
}
else if (item > vector[mid] )
{ low = mid + 1; }
else { high = mid - 1; }
}