0% found this document useful (0 votes)
81 views3 pages

Stacks Using Array Program

This document defines functions to implement a stack using an array data structure in C programming language. It includes functions to push, pop, and show elements in the stack. The main function initializes the stack, prompts the user for a choice of operation, and calls the corresponding function in a loop until the user exits.

Uploaded by

akurathikotaiah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
81 views3 pages

Stacks Using Array Program

This document defines functions to implement a stack using an array data structure in C programming language. It includes functions to push, pop, and show elements in the stack. The main function initializes the stack, prompts the user for a choice of operation, and calls the corresponding function in a loop until the user exits.

Uploaded by

akurathikotaiah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include <stdio.

h>
#include <conio.h>
int stack[100],i,j,choice=0,n,top=-1;
void push();
void pop();
void show();
void main ()
{
clrscr();

printf("Enter the number of elements in the stack ");


scanf("%d",&n);
printf("*********Stack operations using array*********");
printf("\n \n");
while(choice != 4)
{
printf("\nChose one from the below options...\n"); printf("\n1.Push\n2.Pop\
n3.Show\n4.Exit");
printf("\n Enter your choice \n"); scanf("%d",&choice);
switch(choice)
{
case 1:
push();
break;
case 2:

pop();
break;
case 3:

show();
break;
case 4:

printf("Exiting ");
break;

default:
printf("Please Enter valid choice ");
}
};
}
}

void push ()
{
int val;
if (top == n-1 )
printf("\n Overflow");
else
{
printf("Enter the value?");
scanf("%d",&val);
top = top +1;
stack[top] = val;
}
}

void pop ()
{
if(top == -1)
printf("Underflow");
else
{
printf("the delted value =%d\n",stack[top]);
top = top -1;
}
}

void show()
{
for (i=top;i>=0;i--)
{
printf("%d\n",stack[i]);
}
if(top == -1)
{
printf("\nStack is empty\n");
}
}

You might also like