1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61
|
#include<iostream>
using namespace std;
int BinSearch(int data[], int numElements, int searchKey); // Prototype
int main()
{
int data[] = {1, 4, 5, 6, 9, 14, 21, 23, 28, 31, 35, 42, 46, 50, 53, 57, 62, 63, 65, 74, 79, 89, 95};
int numElements = 23; // Size of the Array is 23!!!
int searchKey;
int found;
for(int i = 0; i < numElements; i++)
cout << data[i] << ", ";
cout << endl;
for(;;)
{
cout << "Enter search key: (-1 to exit) "; // I want to exit when I press 'x'. Please let me know.
cin >> searchKey;
if(searchKey == -1)
{
cout << "Exiting\n";
break;
}
found = BinSearch(data, numElements,searchKey);
cout << searchKey << " is in position " << found << endl;
}
}
int BinSearch(int data[], int numElements, int searchKey)
{
int position, mid;
int beg = 0;
int end = numElements;
// Algorithm Begins.
for(int i = beg; i <= end;)
{
mid = (beg+end)/2;
if(data[mid] == searchKey)
{
return mid;
}
else if(data[mid] > searchKey)
{
end = mid - 1;
}
else if(data[mid] < searchKey)
{
beg = mid + 1;
}
}
}
|