Fortune Smiles On Me

queue_base 본문

Programming/Data Structure

queue_base

MinYeop 2014. 3. 7. 14:11

 

 

 

 

 

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

#define array_len 100

int arr[array_len];
int front = 0;
int rear = 0;

void enqueue(int data){
 arr[rear++] = data;
}

int dequeue(void){

 if (front == rear){
  printf("비어있음\n");
  exit(1);
 }
 return arr[front++];
}

int main(void){
 
 enqueue(3);
 enqueue(5);
 enqueue(2);
 enqueue(6);

 printf("%d\n", dequeue());
 printf("%d\n", dequeue());
 printf("%d\n", dequeue());
 printf("%d\n", dequeue());

 return 0;
}

 

'Programming > Data Structure' 카테고리의 다른 글

stack_list  (0) 2014.03.07
stack ADT  (0) 2014.03.07