binary search pseudocode c++ code example
Example 1: binary search program c++
using namespace std;
// This program performs a binary search through an array, must be sorted to work
int binarySearch(int array[], int size, int value)
{
int first = 0, // First array element
last = size - 1, // Last array element
middle, // Mid point of search
position = -1; // Position of search value
bool found = false; // Flag
while (!found && first <= last)
{
middle = (first + last) / 2; // Calculate mid point
if (array[middle] == value) // If value is found at mid
{
found = true;
position = middle;
}
else if (array[middle] > value) // If value is in lower half
last = middle - 1;
else
first = middle + 1; // If value is in upper half
}
return position;
}
int main ()
{
const int size = 5; // size initialization
int array[size] = {1, 2, 3, 4, 5}; // declare array of size 10
int value; // declare value to be searched for
int result; // declare variable that will be returned after binary search
cout << "What value would you like to search for? "; // prompt user to enter value
cin >> value;
result = binarySearch(array, size, value);
if (result == -1) // if value isn't found display this message
cout << "Not found\n";
else // If value is found, displays message
cout << "Your value is in the array.\n";
return 0;
}
Example 2: binary search java
// Java implementation of iterative Binary Search
class BinarySearch {
// Returns index of x if it is present in arr[],
// else return -1
int binarySearch(int arr[], int x)
{
int l = 0, r = arr.length - 1;
while (l <= r) {
int m = l + (r - l) / 2;
// Check if x is present at mid
if (arr[m] == x)
return m;
// If x greater, ignore left half
if (arr[m] < x)
l = m + 1;
// If x is smaller, ignore right half
else
r = m - 1;
}
// if we reach here, then element was
// not present
return -1;
}
// Driver method to test above
public static void main(String args[])
{
BinarySearch ob = new BinarySearch();
int arr[] = { 2, 3, 4, 10, 40 };
int n = arr.length;
int x = 10;
int result = ob.binarySearch(arr, x);
if (result == -1)
System.out.println("Element not present");
else
System.out.println("Element found at "
+ "index " + result);
}
}