Search - Linear search and Binary search [CPP]

Search is a technique to find an item from group of item whose value equal to key value.

Source Code

#include <iostream> using namespace std; class search { int n, a[100], i, j, k, t, m; public: void read() { cout<<"Enter the limit: "; cin>>n; cout<<"Enter "<<n<<" Numbers: "; for(i=0;i<n;i++) { cin>>a[i]; } cout<<"Enter key: "; cin>>k; for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(a[j]<a[i]) { t=a[i]; a[i]=a[j]; a[j]=t; } } } cout<<"Linear search result: "; linear(); cout<<"Binary search result: "; binary(0, n); } void linear() { t=0; for(i=0;a[i]<=k;i++) { if(a[i]==k) { cout<<"Key "<<k<<" Found at position "<<i+1<<"\n"; t=1; } } if(t==0) { cout<<"Key "<<k<<" Not Found\n"; } } void binary(int l, int u) { if(l>u) { cout<<"Key "<<k<<" Not found\n"; } else { m=(l+u)/2; if(a[m]==k) { cout<<"Key "<<k<<" Found at position "<<m+1<<"\n"; } else if(k<a[m]) { binary(l, m-1); } else { binary(m+1, n); } } } }; int main() { search s; s.read(); }