Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #define MAX 10
- int front=-1,rear=-1;
- int q[MAX];
- void insert();
- void del();
- void display();
- int main()
- { int ch;
- while(1)
- {
- printf("Enter your choice\n1.Insert\n2.Delete\n3.Display\n4.Exit\n");
- scanf("%d",&ch);
- switch(ch)
- {
- case 1:insert();
- break;
- case 2:del();
- break;
- case 3:display();
- break;
- case 4:exit(0);
- }
- }
- return 0;
- }
- void insert()
- { int ele;
- printf("Enter the element ");
- scanf("%d",&ele);
- if(rear==MAX-1)
- printf("Queue is full");
- else
- {
- int j=rear;
- while(j>=front&&ele>q[j])
- {
- q[j+1]=q[j];
- j--;
- }
- q[j+1]=ele;
- rear++;
- }
- }
- void del()
- {
- int ele;
- printf("Enter element to be deleted");
- scanf("%d",&ele);
- if(front>rear)
- printf("Queue is full");
- else
- {int i,j;int flag=0;
- for(i=front;i<=rear;i++)
- {if(ele==q[i])
- {
- flag=1;
- for(j=i;j>front;j--)
- q[j]=q[j-1];
- front++;
- break;
- }}
- if(flag==0)
- printf("No element found");
- }
- }
- void display()
- {
- if(front>rear)
- printf("Queue is empty");
- else
- for(int i=front;i<=rear;i++)
- {
- printf("%d\t",q[i]);
- }
- }
Add Comment
Please, Sign In to add comment