Scribd Logo
Upload

Welcome to Scribd!

  • (While (Imax Imin) (: Int Binary - Search (Int A, Int Key, Int Imin, Int Imax)

    Uploaded by

    corello52
    29 views1 page
    This function implements a binary search algorithm to search for a key value in a sorted array. It takes in an array, key value, and min and max indices. It calculates the midpoint index between min and max. If the midpoint value equals the key, it returns the index. Otherwise, it updates either the min or max index based on if the midpoint value is less than or greater than the key, and continues searching in the smaller subarray until the key is found or the subarray is empty.

    Original Description:

    Original Title

    de

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This function implements a binary search algorithm to search for a key value in a sorted array. It takes in an array, key value, and min and max indices. It calculates the midpoint index between min and max. If the midpoint value equals the key, it returns the index. Otherwise, it updates either the min or max index based on if the midpoint value is less than or greater than the key, and continues searching in the smaller subarray until the key is found or the subarray is empty.

    Copyright:

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

    (While (Imax Imin) (: Int Binary - Search (Int A, Int Key, Int Imin, Int Imax)

    Uploaded by

    corello52
    This function implements a binary search algorithm to search for a key value in a sorted array. It takes in an array, key value, and min and max indices. It calculates the midpoint index between min and max. If the midpoint value equals the key, it returns the index. Otherwise, it updates either the min or max index based on if the midpoint value is less than or greater than the key, and continues searching in the smaller subarray until the key is found or the subarray is empty.

    Copyright:

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

    int binary_search(int A[], int key, int imin, int imax)

    {
    // continue searching while [imin,imax] is not empty
    while (imax >= imin)
    {
    // calculate the midpoint for roughly equal partition
    //printf("\nmin:%d max%d",imin,imax);
    int imid = midpoint(imin, imax);

    if(A[imid] == key)
    // key found at index imid //imid
    return 1;
    // determine which subarray to search
    else if (A[imid] < key)
    // change min index to search upper subarray
    imin = imid + 1;
    else
    // change max index to search lower subarray
    imax = imid - 1;
    }
    // key was not found
    return KEY_NOT_FOUND;
    }

    You might also like