que1

• 원형큐 #include #define MAX 10 int front,rear; char queue[MAX]; void init_queue() { front = rear = 0; } void clear_queue() { front = rear; } int put(char* ch) { if( (rear+1)%MAX == front ) return -1; queue[rear] = *ch; rear = ++rear % MAX; return 0; } int get(char* ch) { if( rear == front ) return -1; *ch = queue[front]; front = ++front % MAX; return 0; } void main() { char a,b,c; init_queue(); put("1".. 프로그래밍 언어/프로그래밍 2009. 1. 18.