question archive #include<iostream> using namespace std; int binarysearch(int array[],int start_index, int end_index, int valuetosearch); int binarysearch(int array[],int start_index, int end_index, int valuetosearch) { int mid; while(end_index<=start_index) { mid = ( start_index + end_index ) / 2; if(array[mid]==valuetosearch) { return (mid+1); } else if(array[mid]> valuetosearch) { return binarysearch(array,start_index, mid-1 ,valuetosearch); } else { return binarysearch( array,mid+1, end_index, valuetosearch); } } return 0; } int main() { int start_index = 0, end_index = 9, size; int array[10]; cout<<"enter value for unsorted array "; for(int i=0; i<=10; i++) { cin>>array[i]; } cout<<"values in unsorted array "<<endl; for(int i=0; i<=10; i++) { cout<<" "; cout<<array[i]; } for(int i=0; i<10; i++) { for(int j=0; j<(10 - i-1); j++) { if(array[j]>array[j+1]) { int temp =array[j]; array[j]= array[j+1]; array[j+1]=temp; } } } cout<<endl<<"values in sorted array"<<endl; for(int i=0; i<=10; i++) { cout<<array[i]<<" "; } cout<<endl; int valuetosearch; cout<<"enter value you want to search"<<endl; cin>>valuetosearch; int output; output = binarysearch(array,start_index, end_index ,valuetosearch); if(output == 0) { cout<<"match not found"<<endl; } else { cout<<"match found"<<valuetosearch<<" at position "<<output<<endl; } return 0; }
#include<iostream> using namespace std; int binarysearch(int array[],int start_index, int end_index, int valuetosearch); int binarysearch(int array[],int start_index, int end_index, int valuetosearch) { int mid; while(end_index<=start_index) { mid = ( start_index + end_index ) / 2; if(array[mid]==valuetosearch) { return (mid+1); } else if(array[mid]> valuetosearch) { return binarysearch(array,start_index, mid-1 ,valuetosearch); } else { return binarysearch( array,mid+1, end_index, valuetosearch); } } return 0; } int main() { int start_index = 0, end_index = 9, size; int array[10]; cout<<"enter value for unsorted array "; for(int i=0; i<=10; i++) { cin>>array[i]; } cout<<"values in unsorted array "<<endl; for(int i=0; i<=10; i++) { cout<<" "; cout<<array[i]; } for(int i=0; i<10; i++) { for(int j=0; j<(10 - i-1); j++) { if(array[j]>array[j+1]) { int temp =array[j]; array[j]= array[j+1]; array[j+1]=temp; } } } cout<<endl<<"values in sorted array"<<endl; for(int i=0; i<=10; i++) { cout<<array[i]<<" "; } cout<<endl; int valuetosearch; cout<<"enter value you want to search"<<endl; cin>>valuetosearch; int output; output = binarysearch(array,start_index, end_index ,valuetosearch); if(output == 0) { cout<<"match not found"<<endl; } else { cout<<"match found"<<valuetosearch<<" at position "<<output<<endl; } return 0; }
Subject:Computer SciencePrice: Bought3
#include<iostream>
using namespace std;
int binarysearch(int array[],int start_index, int end_index, int valuetosearch);
int binarysearch(int array[],int start_index, int end_index, int valuetosearch)
{
int mid;
while(end_index<=start_index)
{
mid = ( start_index + end_index ) / 2;
if(array[mid]==valuetosearch)
{
return (mid+1);
}
else if(array[mid]> valuetosearch)
{
return binarysearch(array,start_index, mid-1 ,valuetosearch);
}
else
{
return binarysearch( array,mid+1, end_index, valuetosearch);
}
}
return 0;
}
int main()
{
int start_index = 0, end_index = 9, size;
int array[10];
cout<<"enter value for unsorted array ";
for(int i=0; i<=10; i++)
{
cin>>array[i];
}
cout<<"values in unsorted array "<<endl;
for(int i=0; i<=10; i++)
{
cout<<" ";
cout<<array[i];
}
for(int i=0; i<10; i++)
{
for(int j=0; j<(10 - i-1); j++)
{
if(array[j]>array[j+1])
{
int temp =array[j];
array[j]= array[j+1];
array[j+1]=temp;
}
}
}
cout<<endl<<"values in sorted array"<<endl;
for(int i=0; i<=10; i++)
{
cout<<array[i]<<" ";
}
cout<<endl;
int valuetosearch;
cout<<"enter value you want to search"<<endl;
cin>>valuetosearch;
int output;
output = binarysearch(array,start_index, end_index ,valuetosearch);
if(output == 0)
{
cout<<"match not found"<<endl;
}
else
{
cout<<"match found"<<valuetosearch<<" at position "<<output<<endl;
}
return 0;
}
