Professional Documents
Culture Documents
Linear search
#include<iostream>
int main() {
int n;
cin>>n;
int student[n];
int i,value,pos=-1;
cin>>student[i];
cout<<endl;
cin>>value;
if(student[i]==value)
pos=i+1;
break;
if(pos==-1)
else
return 0;
}
Binary search: