fork download
  1. #include <stdio.h>
  2. #define SIZE 100
  3.  
  4. int queue[SIZE];
  5. int front = -1, rear = -1;
  6.  
  7. void enqueue(int value) {
  8. if (rear == SIZE - 1)
  9. printf("Queue is full\n");
  10. else {
  11. if (front == -1)
  12. front = 0;
  13. rear++;
  14. queue[rear] = value;
  15. printf("Inserted %d\n", value);
  16. }
  17. }
  18.  
  19. void dequeue() {
  20. if (front == -1 || front > rear)
  21. printf("Queue is empty\n");
  22. else {
  23. printf("Deleted: %d\n", queue[front]);
  24. front++;
  25. }
  26. }
  27.  
  28. void display() {
  29. if (front == -1 || front > rear)
  30. printf("Queue is empty\n");
  31. else {
  32. for (int i = front; i <= rear; i++)
  33. printf("%d ", queue[i]);
  34. printf("\n");
  35. }
  36. }
  37.  
  38. int main() {
  39. enqueue(10);
  40. enqueue(20);
  41. display();
  42. dequeue();
  43. display();
  44. return 0;
  45. }
  46.  
  47.  
Success #stdin #stdout 0s 5296KB
stdin
45
stdout
Inserted 10
Inserted 20
10 20 
Deleted: 10
20