Breaking News: Grepper is joining You.com. Read the official announcement!

binary search and without using functions [10,20,30,40,50,60,70,80,90,10]

Ashir Ali Butt answered on September 30, 2023 Popularity 1/10 Helpfulness 1/10

answer binary search and without using functions [10,20,30,40,50,60,70,80,90,10]

binary search and without using functions [10,20,30,40,50,60,70,80,90,10]

Comment

#include <iostream>

int main() {
    int arr[] = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100};
    int target = 10; // The element you want to search for
    int left = 0;
    int right = sizeof(arr) / sizeof(arr[0]) - 1;
    int foundIndex = -1;

    while (left <= right) {
        int mid = left + (right - left) / 2;

        if (arr[mid] == target) {
            foundIndex = mid;
            break;
        } else if (arr[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    if (foundIndex != -1) {
        std::cout << "Element " << target << " found at index " << foundIndex << std::endl;
    } else {
        std::cout << "Element " << target << " not found in the array." << std::endl;
    }

    return 0;
}

Popularity 1/10 Helpfulness 1/10 Language cpp

Source: chat.openai.com

Tags: binary-search c++ using

Link to this answer
Share Copy Link

Contributed on Sep 30 2023

Ashir Ali Butt

0 Answers Avg Quality 2/10

binary search and without using functions [10,20,30,40,50,60,70,80,90,10]

Contents

More Related Answers

binary search and without using functions [10,20,30,40,50,60,70,80,90,10]

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.