Cautare Binara

#include <iostream>
#include <fstream>
using namespace std;

int cautareBinaraDreapta(int st, int dr, int x, int v[100])
{
    int piv, raspuns;
    while(st <= dr)
    {
        piv = (st+dr)/2;
        if(v[piv] == x)
        {
            raspuns = piv;
            st = piv + 1;
        }
        else
        if(v[piv] > x) dr = piv -1;
        else st = piv + 1;
    }
    return raspuns;
}

int cautareBinaraStanga(int st, int dr, int x, int v[100])
{
    int piv, raspuns;
    while(st <= dr)
    {
        piv = (st+dr)/2;
        if(v[piv] == x)
        {
            raspuns = piv;
            dr = piv - 1;
        }
        else
        if(v[piv] > x) dr = piv -1;
        else st = piv + 1;
    }
    return raspuns;
}

int main()
{
    int n,x, v[100];
    cin >> n;
    for(int i = 1; i <=n; i++)
        cin >> v[i];
    cin >> x;
    cout << cautareBinara(1,n,x,v);
    return 0;
}