#include
#include
#include
#define size 100
int top=-1;
int flag=0;
int stack[size];
void push(int *,int);
int pop(int *);
void display(int *);
void push(int s[],int d)
{
    if(top==(size-1))
        flag=0;
    else
    {
        flag=1;
        ++top;
        s[top]=d;
    }
}
int pop(int s[])
{
    int popped_element;
    if(top==-1)
    {
        popped_element=0;
        flag=0;
    }
    else
    {
        flag=1;
        popped_element=s[top];
        --top;
    }
    return(popped_element);
}
void display(int s[])
{
    int i;
    if(top==-1)
    {
        printf("\n stack is empty");
    }
    else
    {
        for(i=top;i>=0;--i)
            printf("\n %d",s[i]);
    }
}
/* this is the main function */
void main()
{
    int data;
    char choice;
    int q=0;
    int top=-1;
    clrscr();
    do
    {
        printf("\n push->i pop->p quit->q:");
        printf("enter your choice");
        do
        {
            choice=getchar();
            choice=tolower(choice);
        }
        while(strchr("ipq",choice)==NULL);
        printf("your choice is %c",choice);
        switch(choice)
        {
        case'i':printf("\n input element to push");
            scanf("%d",&data);
            push(stack,data);
            if(flag)
            {
                printf("\n after inserting ");
                display(stack);
                if(top==(size-1))
                    printf("\n stack is full");
            }
            else
                printf("\n stack is overflown after pushing");
            break;
        case 'p':data=pop(stack);
            if(flag)
            {
                printf("\n data is popped:%d",data);
                printf("\n now the stack is as follows :\n");
                display(stack);
            }
            else
                printf("\n stack is underflown");
            break;
        case'q':q=1;
        }
    }
    while(!q);
}

The post C program to implement stack operations using array first appeared on Student Projects.

 
#include
#include
#include
#include
#define max 20

int top=-1,s[max];
void push(int n)
{
    if(top==max-1)
    {
        puts("stack is over flown");
        return;
    }
    else
    {
        top=top+1;
        s[top]=n;
    }
}
void pop()
{
    int del;
    if(top==-1)
    {
        puts("stack is underflown");
        return;
    }
    else
    {
        del=s[top];
        printf("\n poped element is %d",del);
        top=top-1;
    }
}
void display()
{
    int i;
    if(top==-1)
        puts("stack is empty");
    else
    {
        for(i=top;i>=0;i--)
            printf("\t%d",s[i]);
    }
}
void main()
{
    int opt,n;
    do
    {
        printf("\n 1.push");
        printf("\n 2.pop");
        printf("\n 3.display");
        printf("\n 4.exit");
        printf("enter ur option");
        scanf("%d",&opt);
        switch(opt)
        {
        case1:printf("\n enter any element to push");
            scanf("%d",&n);
            break;
        case2:pop();
            break;
        case3:display();
            break;
        case4:exit(0);
            break;
        }
    }
    while(1);
}

The post C Program which performs stack operations first appeared on Student Projects.