//Ixtiyoriy kiritilgan sonni binar qiqiruv yo'li bilan toping
#include
#include
using namespace std;
int N,t=0;
//binar qiqiruv
int BinarySearch (int A[], int key)
{
int left = 0, right = N, mid;
while (left <= right)
{
t++;
mid = left + (right - left) / 2;
if (key < A[mid]) right = mid - 1;
else if (key > A[mid]) left = mid + 1;
else return mid;
}
return -1;
}
//asosiy funkciya
int main()
{
//setlocale(LC_ALL,"Russian");
int i, key;
cout<<"Elementlar soni: ";
cin>>N;
int A[N];
cout<<"Hosil bo'lgan massiv: ";
for (i=0; i
{
cin>>A[i];
}
int B[N/2],x=0;
for (int j=1; j
{
if (A[j]%2==0)
B[x++]=A[j];
}
for (int i=1; i<=x; i++){
cout << B[i] << " ";
}
sort(B, B + x);
key = B[1];
if (BinarySearch(B, key) == -1) cout<<"Bunday element yo'q.";
else cout<<"element nomeri: "<
Do'stlaringiz bilan baham: |