Scribd Logo
Upload

Welcome to Scribd!

  • Dequeue Circular Array

    Uploaded by

    ASIF ALI KHAN
    19 views5 pages
    1. The document describes an implementation of a circular deque data structure in C including functions to initialize, add/insert items to the front and rear, delete items from the front and rear, and display all items. 2. Key aspects include using a static array to store items, pointers to track the front and rear, and modulo arithmetic to handle wrapping as the front and rear pointers move through the array. 3. Edge cases like an empty deque are handled separately from the general case to avoid errors.

    Original Description:

    Original Title

    Dequeue_Circular_Array

    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
    1. The document describes an implementation of a circular deque data structure in C including functions to initialize, add/insert items to the front and rear, delete items from the front and rear, and display all items. 2. Key aspects include using a static array to store items, pointers to track the front and rear, and modulo arithmetic to handle wrapping as the front and rear pointers move through the array. 3. Edge cases like an empty deque are handled separately from the general case to avoid errors.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    19 views5 pages

    Dequeue Circular Array

    Uploaded by

    ASIF ALI KHAN
    1. The document describes an implementation of a circular deque data structure in C including functions to initialize, add/insert items to the front and rear, delete items from the front and rear, and display all items. 2. Key aspects include using a static array to store items, pointers to track the front and rear, and modulo arithmetic to handle wrapping as the front and rear pointers move through the array. 3. Edge cases like an empty deque are handled separately from the general case to avoid errors.

    Copyright:

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

    Cculay arva imblemetati of depeLR

    dlehinihan avd initializahion of o dlegcl


    # doine MAx-DE&UEUE 10Db
    Stmuct dages N- O

    int item [mAx- DEaUEVEl;


    int fmt;
    Lgical
    vrew of
    int ea CrculaY
    3 caYY
    sfuct dequeis d4
    da þronk = dg. eaY = -1

    Check 1f dlepuews is enbh


    ink embty (sbruet degueu adg) aeaY

    ifCda front == -| 22
    dy-real ==-) Her,! énu
    2-eurn 1 O-fabe
    ele
    3 in
    ingenea add frt( )will mea
    th framk þintar
    u a r dixchon in the arnj LCw-1)-o].
    (w-)

    addfoit

    in tH d a n w a d
    mole the ar bointar
    addread)wid
    ID-»(N-DJ.
    dirchon in the ar
    CN-1)

    addrea

    but a
    and addeay ( ) in a n embly deuas
    addfantC) the fat inder
    wtl add the eloment a
    pecia case.H e r bath printex (inlexe
    fmt and
    ie,tol, and
    in the aYayUpaink
    ildh beubdate ts index lo].
    Nano, the full conditian Cte checka olevflao while injerin)

    G) da frat =dg res +


    OY
    Gi)
    dfmt ==o R2 dg.veaY = N-
    aeay -
    aeaY

    (o) eav hot (N-) (o) CN-1D


    edr
    eck if tle dagreus tul
    int full Csbuct degueus *dy)

    fCCda. ant == d eaí +1) ||


    (dg- famt 0 == 22 dg.eaY = =
    N-))

    net a nw item in e deguLA in sat


    vidaddfrank (stnuct degueu adg) i t ilem)
    i full (d4) 1 check fev
    prinhfC"In Vid insevhion, no YOUm ) ) oLelos
    ekum
    specia cae if
    emby C(da) te daguuauka i

    darofrart dg sear 0
    =
    =

    item,
    empty
    dg>items[dga þankJ
    =

    90nera Case
    o)
    if Cda fat=tN-
    if Cdg-
    =

    da- bont N-1


    =

    el fonk = dg->fank -1;


    itema[dga fant J item;
    =

    day
    3
    ngeyt nu iten in the degue in caY
    Void addhear (stuct degueus a dg it item)
    if full (d4) chuck fr
    pintC\n Vrid ineYhon: no m " ) , olerflas
    eurn;

    if CemblyCdg) &pecia) c a it
    da> frank =
    dg>eaY -
    0; the degea
    days item [dy-sreoar] =itemn enphy
    else
    if Cdg->reaY = = N-1) 0rer c a
    d a eaY = O
    el d g e a Y = d4HAT + 1

    dg sitems [dg-tar) = item

    >Dolete an item om hamk ct a deque


    nt deletehont Cstuct dagueu Adg)
    int item che che for
    i Cemphy Cd4)) undeflow
    PintC n Vaid deltiom: empy dogueus)
    ern
    special c a
    if (da> fank
    ==
    dyaear) e n tHera
    items [dg-» fronk 1; is only, item
    item- dg -1;
    in te'doguaue.
    dq-s famt= dg>rear-
    ekurn item

    tem og Hemsldg> ponk J, qenea a e


    1j( da> fone == N-)
    dg fmt
    else d4> fonkt +13
    2ekun E
    delele an Item pam h e jeay o a cy

    nt deldegeav (stuct degueus dg)


    i int ilem
    if (emphy (d4)) check for
    pointCVaid delctian: emphy dogua) undsrlod
    reurn
    special cae

    item- cg s items [dgs reavI when ere is


    owy ona item
    dy- rear= dg» font -1, =

    in he deqvetus.
    achwn item
    Hem = d4-> iHems [dAear]
    2eper Case
    1 Cdg aeay = = o)
    dg-vcar = N-I
    elue
    d4 eaY = dgo jeaT-1
    nurn item
    3
    print the elemevb ot deveu (fvam frot t zear)
    da)
    vid diploy ( strueh degusle d4)
    i'ni
    dy > fnt;
    hile (i !=dgs scav!
    pmt (n ed, daiten [al)
    i = Ci +1) % N;

    pyint("n Tod" das items Id4 -3Cav);

    (o) CN)
    HAY
    ear
    Ne wok in ths case)
    Si o te deguaua
    Elemen ane files oeaY eAY
    helemens = TaaY +1
    CN-1)
    Elemenb a flas eAY

    font (N-1) C1o) (so)


    #elemon - CN -1) - font +1

    = N- frw
    *Tata nmber ef elemens = N- fomt +eaY 4
    l0+|
    ENamle: 166- SD +
    i t w l not wm
    in falasirg
    61 tuo pecial caes
    i whan elcguee enply7
    nk Si ( shuct degueut d) (-) ++1
    CD -
    C-) +

    101
    i (empy Cag)) Cii) whem here
    u my oma

    element i'n t deques-


    ==eaTo
    CIn this cas t
    ekeyn size
    0D fok + fark +
    sear)
    da»
    5 Cdg frat
    ==

    Si2e1
    e u r n Size
    + da»
    eaY
    +1
    Slze- mAx-
    DERUEUE dg> fmt
    chTn sizu)

    You might also like