Бинарный поиск

#include<algorithm>
#include<cmath>
#include<iostream>
#include <bits/stdc++.h>
#include<vector>
using namespace std;
int main()
{
srand(time(NULL));
int x,a,b,c,i,j,l,r,z;
const int n=10;
int arr[n];
for(int i=1;i<=n;i++)
{
arr[i]=rand()%10;
cout<<arr[i]<<" ";}
for(int i=1;i<=9;i++){
 
for(int j=i+1;i<=10;i++){
 
 
if (arr[j]>arr[i]){
    l=arr[j];
    arr[j]=arr[i];
    arr[i]=l;
}}
 
}
for (i=1;i<=10;i++)
 
 
z=0;
cin>>x;
for(i=1;i<=10;i++)
{
 
if(arr[i]==z)
{b=true;
z=z+1;
}}
if(b==true){
cout<<"chislo x naideno"<<endl;
cout<<z<<endl;
}
if(b==false)
cout<<"chislo x ne naideno";
return 0;
}

#include<algorithm>
#include<cmath>
#include<iostream>
#include <bits/stdc++.h>
#include<vector>
using namespace std;
int main()
{
srand(time(NULL));
int x,a,b,c,i,j,l,r,z,m,k;
const int n=10;
int arr[n];
for(int i=1;i<=n;i++)
{
arr[i]=rand()%10;
cout<<arr[i]<<" ";
}
for(int i=1;i<=9;i++){
 
 
for(int j=i+1;i<=10;j++){
 
 
 
if (arr[i]>arr[j]){
    x=arr[i];
    arr[i]=arr[j];
    arr[j]=x;
}}}
cin>>x;
l=1;
r=n;
j=0;
while((l<=r) and(j==0))
{
c=(l+r)/2;
if(x<arr[c])
r=c-1;
else if (x>arr[c])
l=c+1;
else j=1;
}
if(j==0)
cout<<"X net";
else cout<<"X yest";
return 0;
}