Scribd Logo
Upload

Welcome to Scribd!

  • Practical 3

    Uploaded by

    sᴜᴅᴀʀsʜᴀɴ ᴅᴇsʜᴍᴜᴋʜ
    6 views2 pages
    The document provides code for a C program that implements binary search on an array. It prompts the user to enter the number of elements in the array and the elements. It then prompts for an element to search for and performs a binary search, recursively dividing the search space in half and checking the middle element until the target is found or the space is exhausted, at which point it prints whether the element was found.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides code for a C program that implements binary search on an array. It prompts the user to enter the number of elements in the array and the elements. It then prompts for an element to search for and performs a binary search, recursively dividing the search space in half and checking the middle element until the target is found or the space is exhausted, at which point it prints whether the element was found.

    Copyright:

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

    Practical 3

    Uploaded by

    sᴜᴅᴀʀsʜᴀɴ ᴅᴇsʜᴍᴜᴋʜ
    The document provides code for a C program that implements binary search on an array. It prompts the user to enter the number of elements in the array and the elements. It then prompts for an element to search for and performs a binary search, recursively dividing the search space in half and checking the middle element until the target is found or the space is exhausted, at which point it prints whether the element was found.

    Copyright:

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

    //Write a prgram for Binary Search

    #include<stdio.h>
    #include<conio.h>
    int main()
    {
    int i,low,high,middle,size,search,array[10];
    clrscr();
    printf("Enter number of elements\n");
    scanf("%d",&size);
    printf("Enter elements\n");
    for (i=0;i<size;i++ )
    {
    scanf("%d",&array[i]);
    }
    printf("Enter element to search\n");
    scanf("%d",&search);
    low=0;
    high=size-1;
    middle=(low+high)/2;
    while(low<=high) //till single ele
    {
    if(array[middle]<search)
    {

    low=middle+1;
    }
    else if(array[middle]==search)
    {
    printf("%d found at index %d.\n", search, middle);
    break;
    }
    else
    {
    high=middle-1;
    }
    middle=(low+high)/2;

    }
    if (low>high)
    {
    printf("Not found in the list.\n");
    }
    getch();
    }

    You might also like