AI coding assistant for busy programmers

All

JavaScript

How do you perform a binary search in a given array in C++

C++

#include <iostream>
using namespace std;
int main() {
    int arr[10], i, n, key, beg, end, mid;
    cout << "Enter the size of array: ";
    cin >> n;
    cout << "Enter the elements of array in ascending order: ";
    for (i = 0; i < n; i++) {
        cin >> arr[i];
    }

cout << "Enter the element to be searched: ";
    cin >> key;

beg = 0; // Initializing beg and end variables. 
    end = n - 1;

while (beg <= end) { // Loop will run until condition is true.

mid = (beg + end) / 2; // Finding middle element.

if (key == arr[mid]) { // If middle element is equal to key then print position and break loop.

cout << "\nElement found at position: " << mid + 1 << endl;

break;

} else if (key > arr[mid]) { // If middle element is smaller than key then new beg will be one element after mid.

beg = mid + 1;

} else { // If middle element is greater than key then new end will be one element before mid.

end = mid - 1;

}

if (beg > end) { // If condition becomes false then print not found.

cout << "\nElement not found." << endl;;

}
}

🤖 Code Explanation

The code is written in C++ and it is a program to search an element in an array using binary search. The program takes the size of the array, the elements of the array and the element to be searched as input from the user and prints the position of the element in the array if it is found. If the element is not found, it prints "Element not found".

AI coding assistant for busy programmers

How do you perform a binary search in a given array in C++

C++

🤖 Code Explanation

More problems solved in C++