Scribd Logo
Upload

Welcome to Scribd!

  • 309 22-2S CS 136 Proj9 (Searches)

    Uploaded by

    Qamar Farooq
    8 views2 pages
    The student was given a list of 20 sorted numbers between 10 and 99 and asked to perform a binary search to find a target number between 20 and 80 that was in the list. They showed the step-by-step binary search process, narrowing down the range until finding the target number of 51 in the list. They were also asked to perform a binary search for a number not in the list between 20 and 80.

    Original Description:

    Original Title

    309 22-2S CS 136 Proj9 (Searches) (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The student was given a list of 20 sorted numbers between 10 and 99 and asked to perform a binary search to find a target number between 20 and 80 that was in the list. They showed the step-by-step binary search process, narrowing down the range until finding the target number of 51 in the list. They were also asked to perform a binary search for a number not in the list between 20 and 80.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views2 pages

    309 22-2S CS 136 Proj9 (Searches)

    Uploaded by

    Qamar Farooq
    The student was given a list of 20 sorted numbers between 10 and 99 and asked to perform a binary search to find a target number between 20 and 80 that was in the list. They showed the step-by-step binary search process, narrowing down the range until finding the target number of 51 in the list. They were also asked to perform a binary search for a number not in the list between 20 and 80.

    Copyright:

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

    Project 9

    Binary Search
    Student Name:

    Get 20 sorted numbers around between 10 and 99. Choose a number between 20 and 80 that is in the list. Show binary
    search process until you find it.

    SE MI ME 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

    Repeat the search process for a number that is not in the list. Choose a number between 20 and 80, but not in the list.

    SE MI ME 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
    Search for 51

    SE MI ME 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

    51 9 68 11 22 26 27 32 35 51 52 67 68 71 73 76 77 84 86 87 97 97 99
    51 4 32 11 22 26 27 32 35 51 52 67
    51 6 51 35 51 52 67

    Sort Algorithms
    Method Best Average Worst No. of Searches 10 100 1000 M
    1 Bubble O (n) O (n2) O (n2) Average 100 10,000 M T
    2 Selection O (n2) O (n2) O (n2) Average 100 10,000 M T
    3 Insertion O (n) O (n2) O (n2) Average 100 10,000 M T
    4 Heap O (n log n) O (n log n) O (n log n) Average 30 700 10,000 20M
    5 Merge O (n log n) O (n log n) O (n log n) Average 30 700 10,000 20M
    6 Quick O (n log n) O (n log n) O (n2) Average 30 700 10,000 20M

    You might also like