Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    J2-1 Module9

    Uploaded by

    Sravanthi Vasireddy
    The document describes how binary search works to find a value in a sorted array. It provides an example of searching for the value 5 in an array of numbers, which is found after 2 comparisons by repeatedly dividing the search range in half. A second example searches for the value 20, which is not found in the array after 3 comparisons as each mid-point value is less than 20, narrowing the range until it is empty.

    Copyright:

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

    You might also like

    J2-1 Module9

    Uploaded by

    Sravanthi Vasireddy
    13 views2 pages
    The document describes how binary search works to find a value in a sorted array. It provides an example of searching for the value 5 in an array of numbers, which is found after 2 comparisons by repeatedly dividing the search range in half. A second example searches for the value 20, which is not found in the array after 3 comparisons as each mid-point value is less than 20, narrowing the range until it is empty.

    Original Description:

    Original Title

    J2-1_Module9

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes how binary search works to find a value in a sorted array. It provides an example of searching for the value 5 in an array of numbers, which is found after 2 comparisons by repeatedly dividing the search range in half. A second example searches for the value 20, which is not found in the array after 3 comparisons as each mid-point value is less than 20, narrowing the range until it is empty.

    Copyright:

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

    J2-1 Module9

    Uploaded by

    Sravanthi Vasireddy
    The document describes how binary search works to find a value in a sorted array. It provides an example of searching for the value 5 in an array of numbers, which is found after 2 comparisons by repeatedly dividing the search range in half. A second example searches for the value 20, which is not found in the array after 3 comparisons as each mid-point value is less than 20, narrowing the range until it is empty.

    Copyright:

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

    Binary Search

    Data set: 5, 10, 30, 60, 80, 90, 100, 120

    Int [] array = {5, 10, 30, 60, 80, 90, 100, 120}

    Length of this array = 8

    Int low=0

    Int high=8-1=7

    Searching for 5 in the array:


    Value=5

    Low=0

    High=7

    Condition low should be less than or equal to high

    Mid= (0+7)/2=3 ----------------------------------------> low=0, high=7

    Array [3] =60 and is greater than 5 so high=mid-1=2

    Mid= (0+2)/2=1 ----------------------------------------> low=0, high=2

    Array [1] = 10 and is greater than 5 so high=mid-1=0

    Array [0] = 5 and is equal to 5 so 5 is there in the array

    Comparisons: 2

    Searching for 20 in the array:


    Value=20

    High=7

    Low=0

    Condition is low should be less than or equal to high

    Mid = (0+7)/2=3 ----------------------------------------> low=0, high=7

    Array [3] =60 and is less than 20 so high=mid-1=2;


    Mid = (0+2)/2=1 ----------------------------------------> low=0, high=2

    Array [1] = 10 and is less than 20 so low=mid+1=2

    Mid = (2+2)/2=2 ----------------------------------------> low=2, high=2

    Array [2] = 30 and is greater than 20 so 20 is not found the array

    Comparisons: 3

    You might also like