Scribd Logo
Upload

Welcome to Scribd!

  • Search

    Uploaded by

    Blueberry Shop
    4 views1 page
    Binary search works on a sorted array by finding the midpoint and checking if the target value is smaller or larger, narrowing the search space to the left or right half respectively, repeating until found. It requires a sorted array. Linear search checks each element sequentially from the start until the target value is 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
    Binary search works on a sorted array by finding the midpoint and checking if the target value is smaller or larger, narrowing the search space to the left or right half respectively, repeating until found. It requires a sorted array. Linear search checks each element sequentially from the start until the target value is found.

    Copyright:

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

    Search

    Uploaded by

    Blueberry Shop
    Binary search works on a sorted array by finding the midpoint and checking if the target value is smaller or larger, narrowing the search space to the left or right half respectively, repeating until found. It requires a sorted array. Linear search checks each element sequentially from the start until the target value is found.

    Copyright:

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

    binary search :

    search -> x
    find the midpoint of the array(array length/2). if x smaller than midpoint, left
    side.
    else right side. repeat.
    **array must be sorted increasing.

    linear search :
    search -> x
    check from the 1st element until it finds x.

    You might also like