Stack Implementation Using Array

This blog will deal with implementation of stack using arrays.The implementation is simple yet we need to allocate a pre-defined size.The allocated size may or may not be utilized completely. This makes the array implementation non-flexible.

Using Array

#include<stdio.h> #include<stdlib.h> #define MAX_SIZE 101 int A[MAX_SIZE]; int top=-1; void Push(int x){ if(top==MAX_SIZE-1){ printf("Error;stack overflow\n"); } A[++top]=x; } void pop(){ if(top==MAX_SIZE-1){ printf("Error: No element to pop\n"); } top--; } int Top(){ return A[top]; } void print(){ int i; printf("Stack :"); for(i=0;i<=top;i++){ printf("\n%d",A[i]); } printf("\n"); } int main(){ Push(2); print(); Push(10); print(); pop(); Top(); Push(7); print(); pop(); }



Output

---