Search item in Stack Array by R4R Team


program-

#include< stdio.h>
#include< conio.h>
#define max 50
int stack[max],top=-1;

void create()
{
char ch;
do
{
top++;
printf("Enter Number\n");
scanf("%d",&stack[top]);
printf("Continue(y/n)\n");
ch=getch();
}while(ch=='y');
}

void traverse()
{
int i;
printf("Stack is :\n");
for(i=top;i>=0;i--){
printf("%d ",stack[i]);
}
}

void search()
{
int n,i;
printf("Enter number to search in stack\n");
scanf("%d",&n);
for(i=top;i>=0;i--)
{
if(stack[i]==n)
break;
}
if(i==-1)
printf("Not present in stack");
else
printf("Present at %d index",i);
}

void main()
{
clrscr();
create();
traverse();
search();
getch();
}


output-

Enter Number
2
Continue(y/n)
Enter Number
1
Continue(y/n)
Enter Number
9
Continue(y/n)
Enter Number
3
Continue(y/n)
Enter Number
6
Continue(y/n)
Stack is :
6 3 9 1 2
Enter number to search in stack
9
Present at 2 index




Leave a Comment:
Search
Categories
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!