Source Code : Program implements array as a stack.

_{Program implements array as a stack.}

_#include

_#include

_{#define MAX 10}

_{struct stack}

_{

  _{int arr[MAX] ;}

  _{int top ;}

_{} ;}

_{void initstack ( struct stack * ) ;}

_{void push ( struct stack *, int item ) ;}

_{int pop ( struct stack * ) ;}

_{void main( )}

_{

  _{struct stack s ;}

  _{int i ;}

  _{clrscr( ) ;}

  _{initstack ( &s ) ;}

  _{push ( &s, 11 ) ;}

  _{push ( &s, 23 ) ;}

  _{push ( &s, -8 ) ;}

  _{push ( &s, 16 ) ;}

  _{push ( &s, 27 ) ;}

  _{push ( &s, 14 ) ;}

  _{push ( &s, 20 ) ;}

  _{push ( &s, 39 ) ;}

  _{push ( &s, 2 ) ;}

  _{push ( &s, 15 ) ;}

  _{push ( &s, 7 ) ;}

  _{i = pop ( &s ) ;}

  _{printf ( "\n\nItem popped: %d", i ) ;}

  _{i = pop ( &s ) ;}

  _{printf ( "\nItem popped: %d", i ) ;}

  _{i = pop ( &s ) ;}

  _{printf ( "\nItem popped: %d", i ) ;}

  _{i = pop ( &s ) ;}

  _{printf ( "\nItem popped: %d", i ) ;}

  _{i = pop ( &s ) ;}

  _{printf ( "\nItem popped: %d", i ) ;}

  _{getch( ) ;}

_}

_{/* intializes the stack */}

_{void initstack ( struct stack *s )}

_{

  _{s -> top = -1 ;}

_}

_{/* adds an element to the stack */}

_{void push ( struct stack *s, int item )}

_{

  _{if ( s -> top == MAX - 1 )}

  _{

  _{printf ( "\nStack is full." ) ;}

  _{return ;}

  _}

  _{s -> top++ ;}

  _{s -> arr[s ->top] = item ;}

_}

_{/* removes an element from the stack */}

_{int pop ( struct stack *s )}

_{

  _{int data ;}

  _{if ( s -> top == -1 )}

  _{

  _{printf ( "\nStack is empty." ) ;}

  _{return NULL ;}

  _}

  _{data = s -> arr[s -> top] ;}

  _{s -> top-- ;}

  _{return data ;}

_}