Implement Stack using array in C

/*
www.troubleshootyourself.com
C Program to demonstrate stack implementation using array
*/
#include <stdio.h>
#include <stdlib.h>
#define MAX 10
int STACK[MAX],TOP;
/* display stack element*/
void display(int []);
/* push (insert) item into stack*/
void Push(int [],int);
/* pop (remove) item from stack*/
void Pop(int []);
void main()
{
int ITEM=0;
int choice=0;
TOP=-1;
while(1)
{
printf("Enter Choice (1: display, 2: insert (PUSH), 3: remove(POP)), 4: Exit..:");
scanf("%d",&choice);
switch(choice)
{
case 1:
display(STACK);
break;
case 2:
printf("Enter Item to be insert :");
scanf("%d",&ITEM);
Push(STACK,ITEM);
break;
case 3:
Pop(STACK);
break;
case 4:
exit(0);
default:
printf("\nInvalid choice.");
break;
}
}// end of while(1)
}
/*  function    : display(),
to display stack elements.
*/
void display(int stack[])
{
int i=0;
if(TOP==-1)
{
printf("Stack is Empty .\n");
return;
}
printf("%d <-- TOP ",stack[TOP]);
for(i=TOP-1;i >=0;i--)
{
printf("\n%d",stack[i]);
}
printf("\n\n");
}
/*  
Function to push the elements into stack.
*/
void Push(int stack[],int item)
{
if(TOP==MAX-1)
{
printf("\nStack is full.\n");
return;
}
TOP++;
stack[TOP]=item;
}
<div style="clear:both; margin-top:1em; margin-bottom:1em;"><a href="http://www.troubleshootyourself.com/c-program-to-sort-an-array-using-selection-sort/" target="_blank" class="u99db0d82f6155348f04db1e65f2564c1"><!-- INLINE RELATED POSTS 1/3 //--><style> .u99db0d82f6155348f04db1e65f2564c1 { padding:0px; margin: 0; padding-top:1em!important; padding-bottom:1em!important; width:100%; display: block; font-weight:bold; background-color:#3498DB; border:0!important; border-left:4px solid #E67E22!important; box-shadow: 0 1px 2px rgba(0, 0, 0, 0.17); -moz-box-shadow: 0 1px 2px rgba(0, 0, 0, 0.17); -o-box-shadow: 0 1px 2px rgba(0, 0, 0, 0.17); -webkit-box-shadow: 0 1px 2px rgba(0, 0, 0, 0.17); text-decoration:none; } .u99db0d82f6155348f04db1e65f2564c1:active, .u99db0d82f6155348f04db1e65f2564c1:hover { opacity: 1; transition: opacity 250ms; webkit-transition: opacity 250ms; text-decoration:none; } .u99db0d82f6155348f04db1e65f2564c1 { transition: background-color 250ms; webkit-transition: background-color 250ms; opacity: 2; transition: opacity 250ms; webkit-transition: opacity 250ms; } .u99db0d82f6155348f04db1e65f2564c1 .ctaText { font-weight:bold; color:#ECF0F1; text-decoration:none; font-size: 16px; } .u99db0d82f6155348f04db1e65f2564c1 .postTitle { color:#FFFFFF; text-decoration: underline!important; font-size: 16px; } .u99db0d82f6155348f04db1e65f2564c1:hover .postTitle { text-decoration: underline!important; } </style><div style="padding-left:1em; padding-right:1em;"><span class="ctaText">Recommended: </span>  <span class="postTitle">C Program to Sort an Array Using Selection Sort</span></div></a></div> 
/*  
Function to pop an item from stack.
*/
void Pop(int stack[])
{
int deletedItem;
if(TOP==-1)
{
printf("Stack is empty..\n");
return;
}
deletedItem=stack[TOP];
TOP--;
printf("%d deleted successfully\n",deletedItem);
return;
}

100

101

102

103

104

105

106

107

108

www.troubleshootyourself.com

C Program to demonstrate stack implementation using array

#include <stdio.h>

#include <stdlib.h>

#define MAX 10

int STACK[MAX],TOP;

/* display stack element*/

void display(int []);

/* push (insert) item into stack*/

void Push(int [],int);

/* pop (remove) item from stack*/

void Pop(int []);

void main()

{

int ITEM=;

int choice=;

TOP=-1;

while(1)

{

printf("Enter Choice (1: display, 2: insert (PUSH), 3: remove(POP)), 4: Exit..:");

scanf("%d",&choice);

switch(choice)

{

case 1:

display(STACK);

break;

case 2:

printf("Enter Item to be insert :");

scanf("%d",&ITEM);

Push(STACK,ITEM);

break;

case 3:

Pop(STACK);

break;

case 4:

exit();

default:

printf("\nInvalid choice.");

break;

}

}// end of while(1)

}

/* function : display(),

to display stack elements.

void display(int stack[])

{

int i=;

if(TOP==-1)

{

printf("Stack is Empty .\n");

return;

}

printf("%d <-- TOP ",stack[TOP]);

for(i=TOP-1;i >=;i--)

{

printf("\n%d",stack[i]);

}

printf("\n\n");

}

Function to push the elements into stack.

void Push(int stack[],int item)

{

if(TOP==MAX-1)

{

printf("\nStack is full.\n");

return;

}

TOP++;

stack[TOP]=item;

}

Function to pop an item from stack.

void Pop(int stack[])

{

int deletedItem;

if(TOP==-1)

{

printf("Stack is empty..\n");

return;

}

deletedItem=stack[TOP];

TOP--;

printf("%d deleted successfully\n",deletedItem);

return;

}

Check and run the program here:

You can run the above program on codeboard editor and see the results. You are allowed to modify code and run. In the editor there is a menu at the top-right corner. Here you can see two buttons such as ‘Compile’ and ‘Run’.

Recommended: Reverse string using Stack