배열을 사용한 제한된 큐의 작동.

1. #include<iostream>
2. using namespace std;
4. void insert_q(char *q, int &front, int &rear, char c){
5. if(front==-1){
6. front++;
7. }
8. rear++;
9. q[rear]=c;
10. }
12. void delete_q(char *q, int &front, int &rear){
13. front++;
14. }
16. void print_q(char *q, int front, int rear){
17. int i;
19. cout<<"큐의 현재 상태는 아래와 같다"<<endl;
20. for(i=front;i<rear+1;i++){
21. cout<<q[i]<<endl;
22. }
23. }
25. int main(){
26. char q[10];
27. int front=-1, rear=-1;
29. insert_q(q, front, rear, 'P');
30. insert_q(q, front, rear, 'R');
31. insert_q(q, front, rear, 'B');
32. delete_q(q, front, rear);
33. delete_q(q, front, rear);
34. insert_q(q, front, rear, 'J');
35. insert_q(q, front, rear, 'G');
36. insert_q(q, front, rear, 'K');
37. insert_q(q, front, rear, 'S');
39. print_q(q, front, rear);
41. return 0;
42. }