Scribd Logo
Upload

Welcome to Scribd!

  • Untitled 1

    Uploaded by

    tianna.m.parmar
    8 views1 page
    The document describes linear search and binary search algorithms. For linear search, it initializes a counter, checks each element of the array sequentially against the search value, and increments the counter until a match is found. For binary search, it first sorts the array, then repeatedly checks the middle element, redefining the search space as the left or right half depending on whether the middle element is less than or greater than the search value.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    ODT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes linear search and binary search algorithms. For linear search, it initializes a counter, checks each element of the array sequentially against the search value, and increments the counter until a match is found. For binary search, it first sorts the array, then repeatedly checks the middle element, redefining the search space as the left or right half depending on whether the middle element is less than or greater than the search value.

    Copyright:

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

    Untitled 1

    Uploaded by

    tianna.m.parmar
    The document describes linear search and binary search algorithms. For linear search, it initializes a counter, checks each element of the array sequentially against the search value, and increments the counter until a match is found. For binary search, it first sorts the array, then repeatedly checks the middle element, redefining the search space as the left or right half depending on whether the middle element is less than or greater than the search value.

    Copyright:

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

    OUTPUT “Statement regarding what you need to input”

    INPUT variable name


    IF condition
    THEN OUTPUT “true statement”
    ELSE IF condition
    THEN OUTPUT”true statement”
    ELSE
    OUTPUT “false statement
    END IF

    linear search
    first assign the index no
    a= [“brown”,|”red”,”blue"] a = 0,1,2
    then assign counter to zero\
    counter = 0
    check the value at position counter with the search alue
    a[counter] == search value
    a[0] == red
    brown== red
    false
    if the value is not equal, increment cunter by 1
    counter = counter + 1
    counter = 0 + 1
    counter 1
    a[counter] = search value
    a[1] == 20
    20 == 20
    true
    Hence value was found at position 1

    Binary search
    first arrange the array in ascending order
    a= [20,30,10] a=[10,20,30]
    assign index no to each value
    a= 0,1,2
    assign begin, end and calculate mid= (begin + end )/ 2
    begin = 0 end = 2
    mid 0 + 2 /2 1

    check if the value at mid == search_value then stop


    20 30

    else assign mid to begin or end depending on the value you are searhing
    begin = 1 end 2

    You might also like