Scribd Logo
Upload

Welcome to Scribd!

  • 50 views

    Binary Search

    Uploaded by

    dinesh4504
    The document describes the binary search algorithm to search for a target value in a sorted array. It works by repeatedly dividing the search interval in half and checking if the target value is in the first or second half. It starts by checking the middle element and recursively searches the half in which the target should be present based on the comparison. The algorithm exits if the target is found or the interval becomes empty, otherwise it reports that the target is not present in the array.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Binary Search

    Uploaded by

    dinesh4504
    50 views1 page
    The document describes the binary search algorithm to search for a target value in a sorted array. It works by repeatedly dividing the search interval in half and checking if the target value is in the first or second half. It starts by checking the middle element and recursively searches the half in which the target should be present based on the comparison. The algorithm exits if the target is found or the interval becomes empty, otherwise it reports that the target is not present in the array.

    Original Description:

    algorithm of binary search

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes the binary search algorithm to search for a target value in a sorted array. It works by repeatedly dividing the search interval in half and checking if the target value is in the first or second half. It starts by checking the middle element and recursively searches the half in which the target should be present based on the comparison. The algorithm exits if the target is found or the interval becomes empty, otherwise it reports that the target is not present in the array.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    50 views1 page

    Binary Search

    Uploaded by

    dinesh4504
    The document describes the binary search algorithm to search for a target value in a sorted array. It works by repeatedly dividing the search interval in half and checking if the target value is in the first or second half. It starts by checking the middle element and recursively searches the half in which the target should be present based on the comparison. The algorithm exits if the target is found or the interval becomes empty, otherwise it reports that the target is not present in the array.

    Copyright:

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

    www.eazynotes.

    com

    Gursharan Singh Tatla

    Page No. 1

    BINARY SEARCH
    Binary Search ( ):
    Description: Here A is a sorted array having N elements. ITEM is the value to be searched. BEG denotes first element and END denotes last element in the array. MID denotes the middle value. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. Exit Else Print: ITEM doesnt exist [End of If] Else Set BEG = MID + 1 [End of If] Set MID = (BEG + END) / 2 [End of While Loop] If (A[MID] == ITEM) Then Print: ITEM exists at location MID Set BEG = 1 and END = N Set MID = (BEG + END) / 2 Repeat While (BEG <= END) and (A[MID] ITEM) If (ITEM < A[MID]) Then Set END = MID 1

    You might also like