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 data, 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.  
  32. void enqueue(int value)
  33. {
  34.    if (head == (tail + 1) % SIZE) {
  35.         printf("Queue is full.\n");
  36.         return;
  37.     }
  38.     queue[tail] = value;
  39.     tail = (tail + 1) % SIZE; 
  40.  
  41.  
  42.  
  43.  
  44.  
  45. }
  46.  
  47. int dequeue(void)
  48. {
  49. int value;
  50.     if (head == tail) {
  51.         printf("Queue is empty.\n");
  52.         return -1;
  53.     }
  54.     value = queue[head];
  55.     queue[head] = 0;
  56.     head = (head + 1) % SIZE;
  57.     return value;
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66. }
  67.  
Success #stdin #stdout 0.01s 5276KB
comments (?)
stdin 
Standard input is empty
stdout 
queue[0]=6
queue[1]=0
queue[2]=0
queue[3]=4
queue[4]=5
https://ideone.com/vBSK7i
language:
C (gcc 8.3)
created:
11 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!