The binary_search Algorithm

The binary_search Algorithm

STL’s binary_search() algorithm traverses a sequence and returns a Boolean value indicating whether the sought-after element exists in that sequence. binary_search() is declared in the header as follows:

 bool binary_search (ForwardIterator first,                     ForwardIterator last,                     const T& value)

binary_search() takes two forward iterators that mark the sequence’s bounds, and the sought-after value as the third argument. It returns true if the sought-after value exists in the sequence, or false otherwise. In the following example, binary_search() checks whether the integers 5 and 0 exist in a vector of integers:

 #include #include using namespace std;int main(){  int arr[5] = {1,3,4,5,5};  // set a vector from the array  vector  vi(arr, arr+5);  // search for 5 and 0 in the vector  bool found = binary_search(vi.begin(), vi.end(), 5);// true  found = binary_search(vi.begin(), vi.end(), 0);// false}
Share the Post:
data observability

Data Observability Explained

Data is the lifeblood of any successful business, as it is the driving force behind critical decision-making, insight generation, and strategic development. However, due to its intricate nature, ensuring the

Heading photo, Metadata.

What is Metadata?

What is metadata? Well, It’s an odd concept to wrap your head around. Metadata is essentially the secondary layer of data that tracks details about the “regular” data. The regular