Int linearSearch(int array[], int size, int searchValue)

#include

using namespace std;

#include

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

{
for(int i =0; i < size; i++)
{
if(searchValue == array[i])
{
return i;
}
}
return-1;
}
int main()
{
int a[]={188, 235, 127, 4545, 6987, 1016};
int userValue;
cout<<"Butun son kiriting"<< endl;
cin>> userValue;
int result = linearSearch(a, 6, userValue);
if(result >=0)
{
cout<<"Bu raqam "<< a[result]<<"massiv elementlari orasidan topildi"
" element with index "<< result << endl;
}
else
{
cout<<"Bu raqam "<< userValue <<" massiv elementlari orasidan topilmadi"<< endl;
}
}
using namespace std;

#include

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 a[]={127, 992, 84, 97, 555, 867, 982, 98};
int userValue;
cout<<"Butun son kriting: "<< endl;
cin>> userValue;
int result = binarySearch(a, 8, userValue);
if(result >=0)
{
cout<<"TBu raqam "<< a[result]<<" topildi"
" element index"<< result << endl;
}
else
{
cout<<"Bu raqam:"<< userValue <<" Buraqam topilmadi "<< endl;
}
}