Algoritm căutare binară
#include<iostream> using namespace std; int main() { int a[100],x,st,dr,i,mij,n; cout<<"NM?"; cin>>n; for (i=1; i<=n; i++) { cout<<"a["<<i<<"]="; cin>>a[i]; } cout<<"X?"; cin>>x; st=1; dr=n; while (st<=dr) { mij=(st+dr)/2; if (x==a[mij]) { cout<<"se gaseste pe poz"<<mij; break; } else if (x<a[mij]) dr=mij-1; else st=mij+1; } return 0; }