Algorithm: 큐(Queue) 동적 활당을 이용한 큐 #include #include void main(){int n,q,qsize;int num[100];int *queue;puts("How much do u want to have size of Q? ");scanf("%d",&qsize);queue = (int*)malloc(qsize); for(n=0; nname = name;temp->link = head;}else if(h->link !=head){while(h->link != head){h = h->link;}h->link = temp;temp->name = name;temp->link = head;}} void print_node(){node *temp;temp=head->link;while(temp->link != he.. 더보기 이전 1 2 3 4 5 6 7 ··· 20 다음