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. enqueue(1);
  15. enqueue(2);
  16. dequeue();
  17. enqueue(3);
  18. dequeue();
  19. enqueue(4);
  20. enqueue(5);
  21. dequeue();
  22. enqueue(6);
  23.  
  24. for(i = 0; i < SIZE; i++){
  25. printf("queue[%d] = %d\n", i, queue[i]);
  26. }
  27.  
  28. return 0;
  29. }
  30.  
  31. void enqueue(int value)
  32. {
  33. if ((tail + 1) % SIZE == head) {
  34. return;
  35. }
  36. queue[tail] = value;
  37. tail = (tail + 1) % SIZE;
  38. }
  39. int dequeue(void)
  40. {
  41. if (head == tail) {
  42. return -1;
  43. }
  44. int value = queue[head];
  45. queue[head] = 0;
  46. head = (head + 1) % SIZE;
  47. return value;
  48. }
Success #stdin #stdout 0s 5332KB
stdin
Standard input is empty
stdout
queue[0] = 6
queue[1] = 0
queue[2] = 0
queue[3] = 4
queue[4] = 5