Introducing Radical.sh

Forget Code launches a powerful code generator for building API's

Queue using array in C++

  1. #include<iostream.h>
  2. #include<conio.h>
  3. #include<stdlib.h>
  4. #define SIZE 5
  5. int q[SIZE],front=0,rear=0;
  6. void main()
  7. {
  8. int ch;
  9. clrscr();
  10. void enqueue();
  11. void dequeue();
  12. void display();
  13. while(1)
  14. {
  15. cout<<"\n 1. add element";
  16. cout<<"\n 2. remove element";
  17. cout<<"\n 3.display";
  18. cout<<"\n 4.exit";
  19. cout<<"\n enter your choice:";
  20. cin>>ch;
  21. clrscr();
  22. switch(ch)
  23. {
  24. case 1:
  25. enqueue();
  26. break;
  27. case 2:
  28. dequeue();
  29. break;
  30. case 3:
  31. display();
  32. break;
  33. case 4:
  34. exit(0);
  35. default:
  36. cout<<"\n invalid choice";
  37. }
  38. }
  39. }
  40. void enqueue()
  41. {
  42. int no;
  43. if (rear==SIZE && front==0)
  44. cout<<"queue is full";
  45. else
  46. {
  47. cout<<"enter the num:";
  48. cin>>no;
  49. q[rear]=no;
  50. }
  51. rear++;
  52. }
  53. void dequeue()
  54. {
  55. int no,i;
  56. if (front==rear)
  57. cout<<"queue is empty";
  58. else
  59. {
  60. no=q[front];
  61. front++;
  62. cout<<"\n"<<no<<" -removed from the queue\n";
  63. }
  64. }
  65. void display()
  66. {
  67. int i,temp=front;
  68. if (front==rear)
  69. cout<<"the queue is empty";
  70. else
  71. {
  72. cout<<"\n element in the queue:";
  73. for(i=temp;i<rear;i++)
  74. {
  75. cout<<q[i]<<" ";
  76. }
  77. }
  78. }
  79.