Scribd Logo
Upload

Welcome to Scribd!

  • 42demo Bsearch

    Uploaded by

    purplelydia
    4 views9 pages
    The document describes binary search, an algorithm that finds the index of a key in a sorted array. It maintains the invariant that the key is between the lower and upper bounds. The example shows binary search locating the value 33 by repeatedly checking the middle element and updating the bounds.

    Original Description:

    cos

    Original Title

    42demo-bsearch

    Copyright

    © © All Rights Reserved

    Available Formats

    PPS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes binary search, an algorithm that finds the index of a key in a sorted array. It maintains the invariant that the key is between the lower and upper bounds. The example shows binary search locating the value 33 by repeatedly checking the middle element and updating the bounds.

    Copyright:

    © All Rights Reserved
    Download as PPS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views9 pages

    42demo Bsearch

    Uploaded by

    purplelydia
    The document describes binary search, an algorithm that finds the index of a key in a sorted array. It maintains the invariant that the key is between the lower and upper bounds. The example shows binary search locating the value 33 by repeatedly checking the middle element and updating the bounds.

    Copyright:

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

    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo hi
    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo mid hi
    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo hi
    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo mid hi
    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo hi
    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo mid hi
    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo
    hi
    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo
    hi
    mid
    Binary Search

    Binary search. Given a key and sorted array a[], find index i
    such that a[i] = key, or report that no such index exists.

    Invariant. Algorithm maintains a[lo] key a[hi].

    Ex. Binary search for 33.

    6 13 14 25 33 43 51 53 64 72 84 93 95 96 97
    0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

    lo
    hi
    mid

    You might also like