Computer Engineering
Kanalga Telegram’da o‘tish
تمام فایل های مربوط به دروس اینجا گذاشته و ماندگار خواهند بود. گروه @Com_engineering01Gap پی وی @sireh03
Ko'proq ko'rsatish1 967
Obunachilar
-124 soatlar
+57 kun
+2730 kun
Postlar arxiv
1 967
#include <iostream>
using namespace std;
int binsearch(const int s[], int n, int x) {
int low = 0, high = n - 1;
while (low <= high) {
int mid = (low + high) / 2;
if (x == s[mid])
return mid;
else if (x > s[mid])
low = mid + 1;
else
high = mid - 1;
}
return -1;
}
int main() {
int s[9] = {5, 7, 13, 24, 36, 49, 51, 67, 92};
cout << "Enter x: ";
int x;
cin >> x;
int l = binsearch(s, 9, x);
if (l == -1)
cout << "Not found";
else
cout << "Location: " << l;
return 0;
}
