Scribd Logo
Upload

Welcome to Scribd!

  • Binary Search

    Uploaded by

    Manikya Varshney
    0 views1 page
    This C code implements a binary search algorithm to search for a target value in a sorted array. It takes the array, array size, and target value as inputs, uses a recursive approach to narrow the search range by half each iteration, and returns the index of the matched element or -1 if not found. The main function gets array elements from the user, calls the binary search function, 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, array size, and target value as inputs, uses a recursive approach to narrow the search range by half each iteration, and returns the index of the matched element or -1 if not found. The main function gets array elements from the user, calls the binary search function, and prints the result.

    Copyright:

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

    Binary Search

    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, array size, and target value as inputs, uses a recursive approach to narrow the search range by half each iteration, and returns the index of the matched element or -1 if not found. The main function gets array elements from the user, calls the binary search function, 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 n, int x) {
    3 int start = 0, end = n - 1;
    4 while(start <= end) {
    5 int mid = (start + end) / 2;
    6 if(arr[mid] == x) {
    7 return mid;
    8 }
    9 else if(x < arr[mid]) {
    10 end = mid - 1;
    11 }
    12 else {
    13 start = mid + 1;
    14 }
    15 }
    16
    17 return -1;
    18 }
    19 int main(){
    20 int n;
    21 printf("Enter number of element\n");
    22 scanf("%d",&n);
    23 int a[100];
    24 printf("Enter elements\n");
    25 for(int i=0;i<n;i++){
    26 scanf("%d",&a[i]);
    27 }
    28 int x;
    29 printf("Enter search element\n");
    30 scanf("%d",&x);
    31 printf("%d",binarySearch(a,n,x));
    32 return 0;
    33 }
    34

    You might also like