Binary Search

Medium Recursion PRO

🔒 Login to Unlock

Problem Statement

Write a C program using recursion to perform binary search on a sorted array, printing the index or -1 if not found.

Input Format

First line: n. Second line: n sorted integers. Third line: target value.

Output Format

Print index or -1.

Constraints

1 <= n <= 100

Sample Input

5
10 20 30 40 50
30

Sample Output

Explanation

Recursively check the middle element and search the left or right half based on comparison.

Starter Code

#include <stdio.h>

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

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

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock