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.  
  16. 	enqueue(1);
  17. 	enqueue(2);
  18. 	dequeue();
  19. 	enqueue(3);
  20. 	dequeue();
  21. 	enqueue(4);
  22. 	enqueue(5);
  23. 	dequeue();
  24. 	enqueue(6);
  25.  
  26. 	for(i=0; i<SIZE; i++){
  27. 		printf("queue[%d]=%d\n",i,queue[i]);
  28. 	}
  29.  
  30. 	return 0;
  31. }
  32.  
  33.  void enqueue(int value)
  34.  {
  35.  	if(head == (tail+1)%SIZE){
  36.  		printf("キューは満杯で入りませんでした\n");
  37.  	}else{
  38.  		queue[tail++] = value;
  39.  	}
  40.  	tail = tail % SIZE;
  41.  
  42.  
  43.  }
  44.  int dequeue(void)
  45.  {
  46.  	int value;
  47.  	if(head == tail){
  48.  		printf("キューは空で取り出せませんでした\n");
  49.  		return 0;
  50.  	}else{
  51.  		value = queue[head];
  52.  	}
  53.  	queue[head] =0;
  54.  	head = (head+1) % SIZE;
  55.  
  56.  	return value;
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  }
  63.  
  64.  
Success #stdin #stdout 0s 5288KB
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/xENHDE
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!