Scribd Logo
Upload

Welcome to Scribd!

  • Data Structure

    Uploaded by

    SurajBiswas
    4 views2 pages
    The document discusses an algorithm for searching an element within an array called binary search. It explains that binary search works by first sorting the array, then repeatedly looking at the middle element to determine if the target element is in the lower or upper half of the array, and narrowing the search space accordingly until the element is found or determined not to exist. Steps of the algorithm include inputting an array, finding the middle index, comparing the target element to the element at the middle index, and updating either the lower or upper bound based on the comparison.

    Original Description:

    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
    The document discusses an algorithm for searching an element within an array called binary search. It explains that binary search works by first sorting the array, then repeatedly looking at the middle element to determine if the target element is in the lower or upper half of the array, and narrowing the search space accordingly until the element is found or determined not to exist. Steps of the algorithm include inputting an array, finding the middle index, comparing the target element to the element at the middle index, and updating either the lower or upper bound based on the comparison.

    Copyright:

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

    Data Structure

    Uploaded by

    SurajBiswas
    The document discusses an algorithm for searching an element within an array called binary search. It explains that binary search works by first sorting the array, then repeatedly looking at the middle element to determine if the target element is in the lower or upper half of the array, and narrowing the search space accordingly until the element is found or determined not to exist. Steps of the algorithm include inputting an array, finding the middle index, comparing the target element to the element at the middle index, and updating either the lower or upper bound based on the comparison.

    Copyright:

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

    SurAT 03isuda

    Koll 31308320005
    3'd sem, sc, Geretie
    -

    Binany Sonch algoriBhm

    Let A he an onaey dt n elenent AL AL7 AG

    --A ] Dodn s an element to be seamehad 'mid

    dendes e
    middley lookion 6t a agmant of te elamea a.
    bsun otamay whah
    bsDmol ot amay
    wheh
    UB sthe kower om upper
    and
    is nder cndonakim

    and olota to he
    element
    1) Tnput on Array A n

    Sorted
    V =n, mid ind ((Le +08)/2
    2 LB o,
    and 5 hie (LB=VB) omd a n Jed
    s) epart step y

    (a b - mid4
    5 Ese
    mid +1
    (a) CB =

    mid ((Le +us) /2)


    id

    f A (id r datn -
    7
    (a) Dicply The
    dta foumd"

    T olochis not found


    (a) Dicply
    xit
    Semehn
    Semehin s a pstusence t an ellnent fro m a

    olemant. senching algontm


    alt f tuo
    Lot 61 be
    ype ineon Scnne
    iny Semeh
    sconch
    AHgortam for Seleetim

    () npuk n umber 6t om auny A


    5 f(icn-i)
    epert thrgh step
    2Trtialiee izo amd
    amin a l)
    (b) Lot -

    Zntialne tin and rqpedAanagh sep4 f (itn)


    1) f (aG min
    e) min = a ( ]

    6) LoC J

    5
    (aSwap- t)
    a (loc]
    6) a0)
    =

    a loc Swop

    dipbyAe snrto d aionu


    6
    7

    You might also like