Binary Search

//-************************************//

Author:- Ketan Kulkarni

Version:- Eclipse IDE

//************************************//

#include<iostream>

Using namespace std;

Int main()

{

Int mid,key;

 Int n;

Int roll_no[30];

int flag=0;

cout<<"\n Enter Number of Students:";

 cin>>n;

cout<<"---------------------Roll numbers are in ordered list------------------------"; cout<<"\nEnter"<<n<<"Roll Numbers:\n";

 for(inti=0;i<n;i++)

{

cin>>roll_no[i];

}

cout<<"\nEnter Roll Number to Search:"; cin>>key;

int low=0;

int high=n-1;

while(low<=high)

{

mid=(low+high)/2;

if(key==roll_no[mid])

{

cout<<"\nRollno."<<key<<"attended Program\n\n";

flag=1;

break;

}

if(key<roll_no[mid])

{

high=mid-1;

}

else

{

low=mid+1;

}

}

if(flag==0)

cout<<"\n Rollno."<<key<<"not attended Program\n\n";

return0;

}

/*

***************************************OUTPUT************************************

EnterNumberofStudents:5

---------------------Roll number are in ordered list------------------------

Enter5RollNumbers:

1

2

3

5

6

EnterRollNumbertoSearch:7

Rollno.7notattendedProgram

*************************************OUTPUT**************************************

EnterNumberofStudents:5

---------------------Roll numbers are indered list------------------------

Enter5RollNumbers:

1

2

3

4

5

EnterRollNumbertoSearch:3 Rollno.3attendedProgram

*/