07장 큐(Queue) – 배열을 이용한

Posted on: 2019년 03월 31일 2019년 03월 31일
Categories: 강의자료, 자료구조

배열을 이용한 큐(Queue) 구현 #1 : S007_ArrayQueue.c

#include <stdio.h> #include <stdlib.h> #define QUE_LEN 5 int QUEUE[QUE_LEN]; int front = 0; int rear = 0; void main(int argc, char* argv[]){ }

1
2
3
4
5
6
7
8
9
10
11

#include <stdio.h>
#include <stdlib.h>

#define QUE_LEN 5

int QUEUE[QUE_LEN];
int front = 0;
int rear = 0;

void main(int argc, char* argv[]){
}

배열을 이용한 큐(Queue) 구현 #2

void enqueue(int data){
	if(rear == QUE_LEN-1){
		printf("Overflow\n");
	}
	else{
		QUEUE[++rear] = data;
	}
}

void main(int argc, char* argv[]){
	enqueue(1);
}

void enqueue(int data){

if(rear == QUE_LEN-1){

printf("Overflow\n");

}

else{

QUEUE[++rear] = data;

}

void main(int argc, char* argv[]){

enqueue(1);

}

배열을 이용한 큐(Queue) 구현 #3

void printQueue(){
	int i=0;
	printf("front(%2d), rear(%2d) : ", front, rear);
	for(i=front+1; i<=rear; i++){
		printf("%d  ", QUEUE[i]);
	}
	printf("\n");
}

void main(int argc, char* argv[]){
	enqueue(1);	printQueue();
}

void printQueue(){

int i=0;

printf("front(%2d), rear(%2d) : ", front, rear);

for(i=front+1; i<=rear; i++){

printf("%d ", QUEUE[i]);

}

printf("\n");

}

void main(int argc, char* argv[]){

enqueue(1); printQueue();

}

배열을 이용한 큐(Queue) 구현 #4

int dequeue(){
	if(front == rear){
		printf("Empty\n");
		return -1;
	}
	else{
		return QUEUE[++front];
	}
}

void main(int argc, char* argv[]){
	enqueue(1);	printQueue();
	enqueue(3);	printQueue();
	enqueue(5);	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
}

int dequeue(){

if(front == rear){

printf("Empty\n");

return -1;

}

else{

return QUEUE[++front];

}

void main(int argc, char* argv[]){

enqueue(1); printQueue();

enqueue(3); printQueue();

enqueue(5); printQueue();

printf("POP : %d\n", dequeue()); printQueue();

}

배열을 이용한 큐(Queue) 구현 #5

int peek(){
	if(front == rear){
		printf("Empty\n");
		return -1;
	}
	else{
		return QUEUE[front + 1];
	}
}

void main(int argc, char* argv[]){
	enqueue(1);	printQueue();
	enqueue(3);	printQueue();
	enqueue(5);	printQueue();
	printf("PEEK : %d\n", peek());	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
}

int peek(){

if(front == rear){

printf("Empty\n");

return -1;

}

else{

return QUEUE[front + 1];

}

void main(int argc, char* argv[]){

enqueue(1); printQueue();

enqueue(3); printQueue();

enqueue(5); printQueue();

printf("PEEK : %d\n", peek()); printQueue();

printf("POP : %d\n", dequeue()); printQueue();

}

배열을 이용한 큐(Queue) 완성 버전

#include <stdio.h>
#include <stdlib.h>

#define QUE_LEN 5

int QUEUE[QUE_LEN];
int front = 0;
int rear = 0;

////// queue의 기본함수 enqueue(), dequeue(), +알파함수  peek()
void enqueue(int data){
	if(rear == QUE_LEN-1){
		printf("Overflow\n");
	}
	else{
		QUEUE[++rear] = data;
	}
}

int dequeue(){
	if(front == rear){
		printf("Empty\n");
		return -1;
	}
	else{
		return QUEUE[++front];
	}
}

int peek(){
	if(front == rear){
		printf("Empty\n");
		return -1;
	}
	else{
		return QUEUE[front + 1];
	}
}

////////// queue 추가 함수

void initQueue(){
	front = 0;
	rear = 0;
}

int isEmpty(){
	if(front == rear){
		return 1;	//true
	}
	else{
		return 0;	//false
	}
}

int isFull(){
	if(rear == QUE_LEN - 1){
		return 1;	//true
	}
	else{
		return 0;	//false
	}
}

void printQueue(){
	int i=0;
	printf("front(%2d), rear(%2d) : ", front, rear);
	for(i=front+1; i<=rear; i++){
		printf("%d  ", QUEUE[i]);
	}
	printf("\n");
}

///////// 메인 함수
void main(){
	enqueue(1);	printQueue();
	enqueue(3);	printQueue();
	enqueue(5);	printQueue();
	printf("PEEK : %d\n", peek());	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
	enqueue(7);	printQueue();
	enqueue(9);	printQueue();
	enqueue(11);	printQueue();
	enqueue(13);	printQueue();
	enqueue(15);	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
	printf("PEEK : %d\n", peek());	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
	printf("POP  : %d\n", dequeue());	printQueue();
}

#include <stdio.h>

#include <stdlib.h>

#define QUE_LEN 5

int QUEUE[QUE_LEN];

int front = 0;

int rear = 0;

////// queue의 기본함수 enqueue(), dequeue(), +알파함수 peek()

void enqueue(int data){

if(rear == QUE_LEN-1){

printf("Overflow\n");

}

else{

QUEUE[++rear] = data;

}

int dequeue(){

if(front == rear){

printf("Empty\n");

return -1;

}

else{

return QUEUE[++front];

}

int peek(){

if(front == rear){

printf("Empty\n");

return -1;

}

else{

return QUEUE[front + 1];

}

////////// queue 추가 함수

void initQueue(){

front = 0;

rear = 0;

}

int isEmpty(){

if(front == rear){

return 1; //true

}

else{

return 0; //false

}

int isFull(){

if(rear == QUE_LEN - 1){

return 1; //true

}

else{

return 0; //false

}

void printQueue(){

int i=0;

printf("front(%2d), rear(%2d) : ", front, rear);

for(i=front+1; i<=rear; i++){

printf("%d ", QUEUE[i]);

}

printf("\n");

}

///////// 메인 함수

void main(){

enqueue(1); printQueue();

enqueue(3); printQueue();

enqueue(5); printQueue();

printf("PEEK : %d\n", peek()); printQueue();

printf("POP : %d\n", dequeue()); printQueue();

enqueue(7); printQueue();

enqueue(9); printQueue();

enqueue(11); printQueue();

enqueue(13); printQueue();

enqueue(15); printQueue();

printf("POP : %d\n", dequeue()); printQueue();

printf("PEEK : %d\n", peek()); printQueue();

printf("POP : %d\n", dequeue()); printQueue();

}

whan0623

517