queue.c

Stack, queue, sorting exmaples in C/C++.

#include<stdio.h>
#include<conio.h>

struct queue {
  int rear,front;
  int item[10];
  };

void insert(struct queue *v)
{ int i,x;
 if(v->rear>=5)
 { printf("queue full\n");
   for(i=0;i<5;i++)
   {
    printf("%d\n",v->item[i]);
    }
  }
  else
  {
    printf("enter the item");
    scanf("%d",&x);
    v->item[v->rear]=x;
    v->rear++;
    printf("%d has been added",x);
    }
}

void del(struct queue *v)
{
  int i,x;
   if(v->front==v->rear)
   {
    printf("queue empty");
    }
    else
    {
    x=v->item[v->front];
    printf("%d has been deleted",x);
    v->front++;
     }
}

void main()
{
 struct queue *s;
 int u;
 s->rear=s->front=0;
 printf("enter the term 1 in 2 out 3 exit ");
 scanf("%d",&u);

 while(u!=3)
 {
  switch(u)
  {
   case 1:
   insert(s);
   break;

   case 2:
   del(s);
   break;
   }
   printf("enter the term");
   scanf("%d",&u);
}   }