Scribd Logo
Upload

Welcome to Scribd!

  • FDS 3RD

    Uploaded by

    Aman Tajane
    5 views4 pages
    Linear search and binary search are algorithms used to find a specific element in a collection of data such as an array or list. Linear search has lower time complexity but requires less memory and is simpler to implement, while binary search has higher time complexity but can search large data sets more efficiently by dividing the search space in half each step. Bubble sort, insertion sort, and selection sort are sorting algorithms and their time complexities and stability are compared. Bubble sort has quadratic time complexity in the worst case while insertion and selection sorts have quadratic average time complexity. Bubble and selection sorts are stable while insertion sort is not.

    Original Description:

    FDS

    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
    Linear search and binary search are algorithms used to find a specific element in a collection of data such as an array or list. Linear search has lower time complexity but requires less memory and is simpler to implement, while binary search has higher time complexity but can search large data sets more efficiently by dividing the search space in half each step. Bubble sort, insertion sort, and selection sort are sorting algorithms and their time complexities and stability are compared. Bubble sort has quadratic time complexity in the worst case while insertion and selection sorts have quadratic average time complexity. Bubble and selection sorts are stable while insertion sort is not.

    Copyright:

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

    FDS 3RD

    Uploaded by

    Aman Tajane
    Linear search and binary search are algorithms used to find a specific element in a collection of data such as an array or list. Linear search has lower time complexity but requires less memory and is simpler to implement, while binary search has higher time complexity but can search large data sets more efficiently by dividing the search space in half each step. Bubble sort, insertion sort, and selection sort are sorting algorithms and their time complexities and stability are compared. Bubble sort has quadratic time complexity in the worst case while insertion and selection sorts have quadratic average time complexity. Bubble and selection sorts are stable while insertion sort is not.

    Copyright:

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

    Date

    Page

    Assignment no- 3

    o0Explain lineay and Binamyseorch its Time Com ole!


    ond compare ime and space compleity
    - ngarSearch also Enown as sequenbal Seavch is
    Simple algoihm to Fnd specifcelement wti,
    a collechon DE data,Such as an
    amay OY a list

    -Lo a lineax Seavchyou tart at the begnning


    Of tte collechon and compart each element one by
    with the elemen t to be Searche d [KeyJunbll
    gousnd a nateh.

    Aduantagsi0simpliuby
    No eqimment For Sortd
    Q Memory eeficienty
    Disadvanoges - Taefiueny for lage dato sets
    CaSe Senano

    Time
    haycomplesily
    seavch
    olgoHthm USed
    a
    hgaly
    a
    effcient
    Specifc
    Searchng
    element in
    Sorte d collechon of dota Svch as an
    aray OY list

    Advontoges Oivde and Conguet


    O minmad compaision count
    dassmate
    Date
    Poge

    Ds advontoaqes Sorted Data


    Dstoic dato
    Laek Of £lexibiliy
    Timecomplexiy dlogn)
    ineay lsecrch i Ginary Search
    TiDe the cwoYS case,it I t has te Gme compleziy
    (ompib hasthe bme complexd
    iby
    5pace IL has low spoie TE can haue as ocD
    ampilycamplexiby Qs it opralts it inplementd ieraing
    direcHy an theexishng 0sit does not quie
    dota sbvc addihono O:S

    algonhm for fboraci GeovchGnd its


    Time complexig
    This Seaxch techniqve i s based On fbo nacci
    Senes

    2 3 5 3 2 ) this Seies is formed


    by ading the staving noand con bnue

    adding
    Date
    ( Page

    effiient Seachmehod ybased on


    divide and Conquev

    Time complesity
    Algonthm -
    sepli find fC*) wbich is qealey than or
    isqreakey
    equa to 'n?

    Step. 2 :- it eck) 0, thein slop and pint. element


    hot found

    stzpiiamin Lofsett Fck)n

    j and stop

    peat
    Jf S LAC K=k-2
    epe at sep
    classste
    Dete
    Poge

    Dot Sta bility of snbng


    Compo Bubble, LnSertotion and selechon Sort
    andits Time
    complexiy
    Soring methbd is Soid to be
    Stableie idenbcad
    elemens OcCUYSin Same nlahe ordey

    O Bubble Soxt :
    it has CaSe
    and auag
    Case bime complexity oe oCa)
    bstab:ili yi- 1t is a stable
    soxing algoi thm
    is adapbue hich Mean S It
    perform bettey parbally Sonted list
    aTosexhon Soyt

    CaSP
    and aueroqe Case
    Gme compleiby oE oCA^2)
    b
    stabi liy also Stable algontm
    On Dlarly Sorttd list.
    selechon Soxt:

    a £ffuecy i- woY[t and avprage (ase is ola i)

    bStobi liy hot stable

    You might also like