stack using array : C program

 



Here is the implementation of Stack using Array in C :


Program code:

#include <stdio.h>

#define size 10

int stack[size];

int top=-1;


void push(int x)

{

    if(top>=size)

    {

        printf("\noverflow");

    }

    else

    {

        top++;

        stack[top]=x;

    }

}


void pop()

{

    if(top<=0)

    {

        printf("\nstack is empty.");

        return;

    }

    return stack[top--];

}


void display()

{

    int i;

    if(top<0)

    {

        printf("\nstack is empty");

        return;

    }

    printf("\nstack elements are : ");

    for(i=top;i>=0;i--)

    {

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

    }

    printf("\n");

}


int main()

{

    int op,el,exit=1;

    do

    {

        printf("what action you want to take :\n");

        printf("1.push   2.pop   3.display   4.topvalueandsize   5.exit\n");

        scanf("%d",&op);

        switch(op)

        {

        case 1:

            printf("enter element to be pushed :");

            scanf("%d",&el);

            push(el);

            break;

        case 2:

            printf("poping stack(%d)\n",top);

            pop();

            printf("after poping: ");

            display();

            break;

        case 3:

            display();

            break;

        case 4:

            printf("top value is %d\n",top);

            printf("size of the stack is %d\n",top+1);

            break;

        case 5:

            exit=0;

            break;

        default:

            printf("enter valid key.\n");

            break;

        }

    }while(exit==1);

    return 0;

}

---------------------------------------------------------------------------------

output :




Comments

Post a Comment

Popular posts from this blog

swapping first and last digits of a number :Python Program

Image
  Here is the program for swapping first and last digits of a number in Python programming language program code : n=int(input("number:")) last=n%10 n=int(n/10) n1=str(n) n2=str(1) n6=str(1) for i in range(len(n1)-1):     n2=n2+str(0)     n6=n6+str(0) n6=int(n6) n2=int(n2) n5=int(n/n6) n3=n%n2 print(n5) n4=str(last)+str(n3)+str(n5) print(int(n4)) output : enter number :284517 784512 happy coding. comment what you need.
Read more

infix to postfix expression converter in "C" language

 program: #include<stdio.h> void infix_to_postfix(char[],char[]); int precedence(char); void main() { char infix[20],postfix[20]; printf("enter infix string : "); scanf("%s",infix); infix_to_postfix(infix,postfix); printf("\npostfix exp= %s",postfix); } void infix_to_postfix(char infix[],char postfix[]) { char s[20],symbol; int top=-1,i=0,j=0; while(infix[i]!='\0') { symbol=infix[i]; switch(symbol) { case '(':++top;          s[top]=symbol;          break;     case ')':while(s[top]!='(')              {               postfix[j++]=s[top];               top--; }           top--;           break;     case '+':     case '-':     case '*':     case '^':     case '/':           while(precedence(symbol)<=precedence(s[top]) && top!=-1)                    postfix[j++]=s[top--];    
Read more

Implementation of Stack with Singly Linked List : C Program

Image
  Here is the code for implementation of stack with singly linked list : program code : #include<stdio.h> #include <stdlib.h> struct node {     int data;     struct node *next; }; struct node *top=NULL; void push(int d) {     struct node *newnode=(struct node*)malloc(sizeof(struct node));     newnode->data=d;     newnode->next=NULL;     if(top==NULL)     {         top=newnode;     }     else{         newnode->next=top;         top=newnode;     }     printf("\ndata %d has been pushed (entered to stack).",d); } void pop() {     struct node *p,*temp=top;     if(temp=NULL)     {         printf("\nstack is empty.");         return;     }     p=top;     top=top->next;     free(p);     printf("\ntop element has been poped(deleted)."); } void display() {     struct node *p=top;     if(p==NULL)     {         printf("\nstack is empty.");         return;     }     printf("\nstack elements are : ");     while(p!= NULL)     {
Read more