수다닷컴

c언어초급문제답변좀..질문 내용 : 빨갛게 표시한부분
#include stdio.h
#includeconio.h
#include iostream
using namespace std;
#define max_element 100
struct heaptype {
int heap[max_element];
int heap_size;
};
heaptype* createheap()
{
heaptype *h = new heaptype;
h-heap_size=0;
return h;
}
void insertheap(heaptype *h, int item)
{
int i;
h-heap_size = h-heap_size +1;
i = h-heap_size;
while((i!=1) && (item h-heap[i/2])){
h-heap[i] = h-heap[i/2];
i/=2;
}
h-heap[i] = item;
}
int deleteheap(heaptype *h)
{
int parent, child;
int item, temp;
item = h-heap[1];
temp = h-heap[h-heap_size];
h-heap_size = h-heap_size -1;
parent = 1;
child = 2;
while(child = h-heap_size) {
if((child h-heap_size) && (h-heap[child]) h-heap[child+1])
child++;
if (temp = h-heap[child]) break;
h-heap[parent] = h-heap[child];
parent = child;
child = child*2;
}
h-heap[parent] = temp;
return item;
}
void printheap(heaptype *h)
{
int i;
printf(heap : );
for(i=1; i= h-heap_size; i++){
printf([%d] , h-heap[i]);
}
}
int main()
{
int i, n, item;
heaptype *heap = createheap();
insertheap(heap, 1);
insertheap(heap, 45);
insertheap(heap, 19);
insertheap(heap, 11);
insertheap(heap, 96);
printheap(heap);
n= heap-heap_size;
for(i=1; i=n; i++){
item = deleteheap(heap);
printf(\n delete : [%d] , item);
}

getch();
return 0;
}

--------------------------------------------------------

저기서 i가 3이면 어째야하는거? 배열은 1.5 이런개념 없자나여

신청하기