반응형
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
#define MAX 50
int queue[MAX]; //Queue
int front = 0;
int rear=0; //Front , Rear
void put(int); //Data Put
int get();
void main(){
put(5);
put(10);
put(15);
put(20);
put(30);
checkQueue();
ret = get();
ret = get();
ret = get();
checkQueue();
ret = get();
ret = get();
checkQueue();
}
void put(int data){
queue[rear++] = data;
}
void get(){
int ret;
ret= queue[front++];
return ret;
}
void checkQueue(){
int i;
for(i=front; i<rear; i++){
printf("%2d-", queue[i]);
}
}
//overflow가 날 수 있으므로, Ring buffer 를 이용한 Queue
|
cs |
반응형