Binary Search

Medium Recursion

Solve in Playground →

Problem Statement

Write a recursive C function to implement Binary Search on a sorted array.

Input Format

First line: N and Target. Second line: N sorted space-separated integers.

Output Format

Print the index of Target, or -1 if not found.

Constraints

1 <= N <= 1000

Sample Input

5 9
1 3 5 7 9

Sample Output

Explanation

Target 9 is located at index 4 in the sorted array.

Starter Code

#include <stdio.h>

int binarySearch(int arr[], int low, int high, int target) {
    // Write recursive binary search here
}

int main() {
    int n, target;
    if (scanf("%d %d", &n, &target) == 2) {
        int arr[n];
        for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
        printf("%dn", binarySearch(arr, 0, n - 1, target));
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →