Guest User

Untitled

a guest
Nov 14th, 2018
109
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.33 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #define MAX 10
  4. int front=-1,rear=-1;
  5. int q[MAX];
  6. void insert();
  7. void del();
  8. void display();
  9. int main()
  10. { int ch;
  11. while(1)
  12. {
  13. printf("Enter your choice\n1.Insert\n2.Delete\n3.Display\n4.Exit\n");
  14. scanf("%d",&ch);
  15. switch(ch)
  16. {
  17. case 1:insert();
  18. break;
  19. case 2:del();
  20. break;
  21. case 3:display();
  22. break;
  23.  
  24. case 4:exit(0);
  25. }
  26. }
  27. return 0;
  28. }
  29. void insert()
  30. { int ele;
  31. printf("Enter the element ");
  32. scanf("%d",&ele);
  33. if(rear==MAX-1)
  34. printf("Queue is full");
  35. else
  36. {
  37. int j=rear;
  38. while(j>=front&&ele>q[j])
  39. {
  40. q[j+1]=q[j];
  41. j--;
  42. }
  43. q[j+1]=ele;
  44. rear++;
  45. }
  46. }
  47. void del()
  48. {
  49. int ele;
  50. printf("Enter element to be deleted");
  51. scanf("%d",&ele);
  52. if(front>rear)
  53. printf("Queue is full");
  54. else
  55. {int i,j;int flag=0;
  56. for(i=front;i<=rear;i++)
  57. {if(ele==q[i])
  58. {
  59. flag=1;
  60. for(j=i;j>front;j--)
  61. q[j]=q[j-1];
  62. front++;
  63. break;
  64. }}
  65. if(flag==0)
  66. printf("No element found");
  67.  
  68. }
  69.  
  70. }
  71. void display()
  72. {
  73. if(front>rear)
  74. printf("Queue is empty");
  75. else
  76. for(int i=front;i<=rear;i++)
  77. {
  78. printf("%d\t",q[i]);
  79. }
  80. }
Add Comment
Please, Sign In to add comment