binary_search_30-Seconds-of-C++, C++ (gcc)

Language: Layout:

//C++ code to demonstrate binary_search

#include <iostream>
#include <algorithm>

using std::cout;
using std::binary_search;
using std::sort;

void show(int a[], int arraysize) { 
    for (int i = 0; i < arraysize; ++i) { 
        cout << a[i] << " ";
    }
} 
  
int main() { 
    int a[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 };
    
    int asize = sizeof(a) / sizeof(a[0]); 
    
    cout << "\nThe array is : "; 
    
    show(a, asize); 
  
    cout << "\n\nLet's say we want to search for 2 in the array"; 
    cout << "\nSo, we first sort the array"; 
    
    sort(a, a + asize); 
    
    cout << "\n\nThe array after sorting is : "; 
    
    show(a, asize); 
    
    cout << "\n\nNow, we do the binary search"; 
    
    if (binary_search(a, a + 10, 2))
        cout << "\nElement found in the array"; 
        
    else
        cout << "\nElement not found in the array"; 
        
    cout << "\n\nNow, say we want to search for 10"; 
    
    if (binary_search(a, a + 10, 10))
        cout << "\nElement found in the array"; 
    
    else
        cout << "\nElement not found in the array"; 
    
    return 0; 
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.82 sec, absolute running time: 0.07 sec, cpu time: 0.01 sec, memory peak: 3 Mb, absolute service time: 0,9 sec