#include<stdio.h>
#define MAX 10
int top=-1;
void push(int arr[],int element);
int pop(int arr[]);
int peek(int arr[]);
int isFull();
int isEmpty();
int main()
{
//implement main function in your way. main function is written only for testing purpose
//let me know about any discrepency
int arr[MAX];
int data=0;
int i=0;
for(i=0;i<10;i++){
scanf("%d",&data);
push(arr,data);
}
push(arr,data);
data=pop(arr);
printf("%d",data);
return 0;
}
void push(int arr[],int element)
{
if(isFull()){
printf("Array Full\n");
return;
}
arr[++top]=element;
}
int pop(int arr[]){
if(!isEmpty){
printf("Array Empty\n");
return;
}
return arr[top--];
}
int peek(int arr[]){
if(isEmpty){
printf("Array Empty\n");
return;
}
return arr[top];
}
int isFull()
{
if(top==MAX-1)
return 1;
return 0;
}
int isEmpty()
{
if(top==-1)
return 1;
return 0;
}Monday, 5 October 2015
Simplest Program to implement Stack using Array
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment