fork download
copy 
  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.     head = tail = 0;
  12.     int data, i;
  13.  
  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.     if((tail + 1) % SIZE == head){
  33.         printf("キューは満杯で入りませんでした\n");
  34.     } else {
  35.         queue[tail] = value;
  36.         tail = (tail + 1) % SIZE;
  37.     }
  38. }
  39.  
  40. int dequeue(void){
  41.     int value;
  42.     if(head == tail){
  43.         printf("キューは空で取り出せませんでした\n");
  44.         return 0;
  45.     } else {
  46.         value = queue[head];
  47.         head = (head + 1) % SIZE;
  48.         return value;
  49.     }
  50. void display(void)
  51. {
  52.     printf("\nキューの内容:\n");
  53.     int i = head;
  54.     while(i != tail){
  55.         printf("queue[%d]=%d\n", i, queue[i]);
  56.         i = (i + 1) % SIZE;
  57.     }
  58. }
  59. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
queue[0]=6
queue[1]=2
queue[2]=3
queue[3]=4
queue[4]=5
https://ideone.com/ivfRry
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!