Scribd Logo
Upload

Welcome to Scribd!

  • Program To Search A Given Value in List Using Binary Searching Method

    Uploaded by

    jayesh_meena
    5 views2 pages
    This program uses binary search to find a given value in a sorted list of integers. It takes user input for the number of list elements and their values, sorts the list, prompts the user to input a search value, calls the binary search function to find the position of the value, and displays the result. The binary search function takes the sorted array, size and search value, recursively halves the search range, compares to the middle element and updates the range until the value is found or the range is exhausted.

    Original Description:

    B search

    Original Title

    b Search

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This program uses binary search to find a given value in a sorted list of integers. It takes user input for the number of list elements and their values, sorts the list, prompts the user to input a search value, calls the binary search function to find the position of the value, and displays the result. The binary search function takes the sorted array, size and search value, recursively halves the search range, compares to the middle element and updates the range until the value is found or the range is exhausted.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    5 views2 pages

    Program To Search A Given Value in List Using Binary Searching Method

    Uploaded by

    jayesh_meena
    This program uses binary search to find a given value in a sorted list of integers. It takes user input for the number of list elements and their values, sorts the list, prompts the user to input a search value, calls the binary search function to find the position of the value, and displays the result. The binary search function takes the sorted array, size and search value, recursively halves the search range, compares to the middle element and updates the range until the value is found or the range is exhausted.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    PROGRAM TO SEARCH A GIVEN VALUE IN LIST USING BINARY SEARCHING METHOD

    #include<iostream.h> #include<conio.h> #include<graphics.h> int bsear(int [],int ,int); void sort(int [],int); void main() { clrscr(); int ar[20],it ,n,k,i; cout<<"enter no. of elements\t"; cin>>n; cout<<"enter array elenments"; for(i=0;i<n;i++) cin>>ar[i]; sort(ar,n); cout<<"\n array after sorting \n"; for(i=0;i<n;i++) cout<<ar[i]<<"\t"; cout<<"enter the no. to be searched\t"; cin>>it; k=bsear(ar,n,it); cout<<"\n no is at position\t\t"<<k; getch(); } int bsear(int ar[],int n,int it) { int mid,i; int beg=0,last=n-1; while(beg<=last) { mid=(beg+last)/2; if(it==ar[mid]) return mid+1; else if(it<ar[mid]) last=mid-1; else beg=mid+1;}

    return -1; } void sort(int ar[],int n) { int tmp,ctr=0; for(int i=0;i<n;i++) {for (int j=0;j<(n-1)-i;j++) { if(ar[j]>ar[j+1]) {tmp=ar[j]; ar[j]=ar[j+1]; ar[j+1]=tmp; } } cout<<"array after iteration-"<<++ctr<<"-is"; for(int k=0;k<n;k++) cout<<ar[k]<<" "; cout<<endl; } }

    You might also like