목차
소스
실행결과
실행결과
본문내용
;
for(i=1; i<=6 ; i++) {
printf(\"%d번째 값: %d\\n\",i,heap1.heap[i]);
}
printf(\"------------------------------\\n\");
printf(\"우선순위가 높은 값 부터 출력\\n\");
printf(\"%d\\n\",delete_max_heap(&heap1)); //우선순위큐 반환
printf(\"%d\\n\",delete_max_heap(&heap1));
printf(\"%d\\n\",delete_max_heap(&heap1));
printf(\"%d\\n\",delete_max_heap(&heap1));
printf(\"%d\\n\",delete_max_heap(&heap1));
printf(\"%d\\n\",delete_max_heap(&heap1));
}
실행결과
for(i=1; i<=6 ; i++) {
printf(\"%d번째 값: %d\\n\",i,heap1.heap[i]);
}
printf(\"------------------------------\\n\");
printf(\"우선순위가 높은 값 부터 출력\\n\");
printf(\"%d\\n\",delete_max_heap(&heap1)); //우선순위큐 반환
printf(\"%d\\n\",delete_max_heap(&heap1));
printf(\"%d\\n\",delete_max_heap(&heap1));
printf(\"%d\\n\",delete_max_heap(&heap1));
printf(\"%d\\n\",delete_max_heap(&heap1));
printf(\"%d\\n\",delete_max_heap(&heap1));
}
실행결과
소개글