Something

// binary search#include <iostream>using namespace std;const int n= 5;int main(){   int x[n] = {1,2,3,4,5};   int low=0, high=5;   int t=0;   int vid=0;   int search=2;   while (t == 0 && high > low)   {	   vid = low + high / 2;	   if (x[vid] == search) t =1;	   if (x[vid] < search ) low = vid;	   else high = vid;   }   if (t == 1) cout << "Reiskme rasta: " << x[vid];   return 0;}