[go: up one dir, main page]
Scribd
Upload
70 views2 pages

Array Implementation of Stack

Uploaded by

Shrey Khokhawat
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
70 views2 pages

Array Implementation of Stack

Uploaded by

Shrey Khokhawat
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ARRAY IMPLEMENTATION OF STACK

#inc lude<std io .h>


#inc lude<con io .h>
vo id main ( )
{
i n t a [100] , i , b , s , cho i ce , top=0;
c l r sc r ( ) ;
pr in t f ( " \nEn te r the s i ze o f the s tack" ) ;
scan f ( "%d" ,&s ) ;
connec t :
pr in t f ( " \n \n \ tMENU\n \n" ) ;
pr in t f ( " \n \n1 .PUSH\n \n2 .POP \n \n3 .D ISPLAY \n \n4 .EX IT " ) ;
pr in t f ( " \n \nEnte r your cho i ce" ) ;
scan f ( "%d" ,&cho i ce ) ;
sw i t ch (cho i ce )
{
case 1 :
i f ( t op==s)
{
pr in t f ( " \n \nThe s tack i s f u l l " ) ;
}
e l se
{
pr in t f ( " \n \nEnte r the data t o be ente red" ) ;
scan f ( "%d" ,&b) ;
}
i f ( t op<s )
{
a [ top ]=b ;
t op=top+1;
}
goto connec t ;
case 2 :
i f ( t op>0)
{
t op=top - 1 ;
b=a[ top ] ;
pr in t f ( " \n \nE lement %d i s popped" ,b ) ;
}
e l se
pr in t f ( " \nS tack i s empty" ) ;
goto connec t ;
case 3 :
i f ( t op==0)
{
pr in t f ( " \n \nThe s tack i s empty a re" ) ;
}
e l se
{
pr in t f ( " \n \nThe e lements o f s tack a re : " ) ;
f o r ( i= top - 1 ; i>0 ; i - - )
{
pr in t f ( " \n%d" ,a [ i ] ) ;
}
}
goto connec t ;
case 4 :
{
break ;
}}
getch ( ) ;
}

You might also like