2-Tajriba ishi. 5-variant. Bajardi: Togayev Doston Tekshirdi: Bo’riyev. Y

Jurnal bo’yicha masala sharti:5-variant

Binar qidiruvdan foydalanib elementlarni tasodifiy ravishda toping.

Dastur kodi:

// Binar qidiruvdan foydalanib elementlarni tasodifiy ravishda toping.

#include

using namespace std;

int binarySearch(int array[], int size, int searchValue)

{

int low =0;

int high = size -1;

int mid;

while (low <= high)

{

mid = (low + high)/2;

if(searchValue == array[mid])

{

return mid;

}

else if (searchValue > array[mid])

{

low = mid + 1;

}

else

{

high = mid -1;

}

}

return -1;

}

int main()

{

int userValue;

int a[]= {12,22,34,47,55,67,82,98 };

cout<<"Enter an integer: "<

cin>> userValue;

int result = binarySearch(a,8,userValue);

if(result >= 0)

{

cout<<"the number "<< a[result] <<" was found at the"

"element with index"<

}

else

{

cout<<"The number"<

}

}

Dastur kodi natijasi:

Dastur natijasi:



XULOSA: Ushbu tajriba ishini bajarish davomida turli xil qidiruv usularidan foydalanishni va ularni dastur kodlarini yozishni ko’rib chiqdik.