Thread: stack implementation using arrays

Code:

#include <stdio.h>#include <unistd.h>
#include <stdlib.h>
#define STACKSIZE 100


struct stackk
{
    int top;
    int items[STACKSIZE];
};
typedef struct stackk *s;


void push(int n)
{
    if(s.top==STACKSIZE-1)
    {
        printf("Stack overflow");
        exit(0);
    }
    s.items[s.top++]=n;
    return;
}
int pop()
{
    int n;
    if(s.top==-1)
    {
        printf("Stack underflow");
        exit(0);
    }
    n=s.items[s.top--];
    return;


}
void display()
{
    int i;
    for(int i=0;i<s.top+1;i++)
    printf("%d\n",s.items[i]);
}
int main()
{
    int ch,n;
    while(1)
    {
        printf("1.Enter item\n2.Remove item\m3.Exit\n\nEnter your choice: ");
        scanf("%d",&ch);
        switch(ch)
        {
        case 1:
            printf("Enter the dats\n");
            scanf("%d",&n);
            push(n);
            display();
            break;
        case 2:
            pop();
            display();
            break;
        case 3:
            exit(0);
        }
    }
}