implementation of two stacks using single array?

Question

can anyone give me the c code for implementing two stacks using single array?
and code for peforming insertions and deletions at both ends of a double ended queue,plz????

Answer 1

there's an example here:
http://www.macs.hw.ac.uk/flex/BScCS/ds1/activity5.html

Answer 2

ARR [===============]
0 1 2 3 4 5 6 ... N-1 N

Suppose you have just an array ARR of size N, then you could implement two stacks by assuming that the two stacks grow inwards from either side of the array, the left stack growing 0, 1, 2 .. while growing, while the right-stack pointer becoming N, N-1, N-2 while storing new elements. While pushing or popping, one needs to make sure that over-flow and under-flow conditions are checked.
HTH.

Answer 3

Here is the link to my code (though in java) - here for 2 stacks in 1 array.

Answer 4

specific i will bt what form of help u necessary pls specify Stacks artwork on LIFO theory LIFO:- final In First Out 2 substantial operations are POP & PUSH Array implementation of Stack is extremely undemanding.