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.  
  33. void enqueue(int value)
  34. {
  35.    if(head == (tail+1)%SIZE)
  36. 	{
  37. 		printf("すでに満杯です。");
  38. 	}
  39. 	else
  40. 	{
  41. 		queue[tail] = value;
  42. 		tail++;
  43. 	}
  44. 	tail = tail%SIZE;
  45. }
  46.  
  47.  
  48. int dequeue(void)
  49. {
  50. 	int value;
  51. 	if(head == tail)
  52. 	{
  53. 		printf("抽出する要素がありません。");
  54. 	}
  55. 	else
  56. 	{
  57. 		value = queue[head];
  58. 		queue[head] = 0;
  59. 		head++;
  60. 	}
  61. 	head =head%SIZE;
  62. 	return value;
  63. }
  64.  
Success #stdin #stdout 0s 5320KB
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/LXQBTo
language:
C (gcc 8.3)
created:
16 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!