Scribd Logo
Upload

Welcome to Scribd!

  • Binary Search Using Recurison

    Uploaded by

    Manikya Varshney
    6 views1 page
    This C code implements a binary search algorithm to search for a target value in a sorted array. It takes the array, start and end indices, and target value as arguments. It recursively searches the left or right half of the array by comparing the middle element to the target until the target is found or the range is exhausted, then returns the index or -1. The main function gets array elements from the user, calls binarySearch to search for a target value entered by the user, and prints the result.

    Original Description:

    Lab Work

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C code implements a binary search algorithm to search for a target value in a sorted array. It takes the array, start and end indices, and target value as arguments. It recursively searches the left or right half of the array by comparing the middle element to the target until the target is found or the range is exhausted, then returns the index or -1. The main function gets array elements from the user, calls binarySearch to search for a target value entered by the user, and prints the result.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Binary Search Using Recurison

    Uploaded by

    Manikya Varshney
    This C code implements a binary search algorithm to search for a target value in a sorted array. It takes the array, start and end indices, and target value as arguments. It recursively searches the left or right half of the array by comparing the middle element to the target until the target is found or the range is exhausted, then returns the index or -1. The main function gets array elements from the user, calls binarySearch to search for a target value entered by the user, and prints the result.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    1 #include<stdio.

    h>
    2 int binarySearch(int arr[], int start, int end, int x) {
    3 if(start >end){
    4 return -1;
    5 }
    6 int mid = (start + end) / 2;
    7 if(arr[mid] == x) {
    8 return mid;
    9 }
    10 else if(x < arr[mid]) {
    11 return binarySearch(arr,start,mid-1,x);
    12 }
    13 else {
    14 return binarySearch(arr,mid+1,end,x);
    15 }
    16 return -1;
    17 }
    18 int main(){
    19 int n;
    20 printf("Enter number of element\n");
    21 scanf("%d",&n);
    22 int a[100];
    23 printf("Enter elements\n");
    24 for(int i=0;i<n;i++){
    25 scanf("%d",&a[i]);
    26 }
    27 int x;
    28 printf("Enter search element\n");
    29 scanf("%d",&x);
    30 printf("%d",binarySearch(a,0,n-1,x));
    31 return 0;
    32 }
    33
    34

    You might also like