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