Fill the gaps : #include #include "fatal.h" #include "heapsort.h" void Swap( ElementType *Lhs, ElementType *Rhs ) { ElementType Tmp = *Lhs; *Lhs = *Rhs; *Rhs = Tmp; } /* START: fig7_8.txt */ void PercDown( ElementType A[ ], int P, int N ) { int Child, i; ElementType Tmp; Tmp = A[P]; /* 1*/ for( i = P; < N; i = Child ) { /* 2*/ Child = ____________; /* 3*/ if( Child != N - 1 && A[ Child + 1 ] > A[ Child ] ) /* 4*/ Child++; /* 5*/ if( ___________ ) /* 6*/ A[ i ] = A[ Child ]; else /* 7*/ break; } /* 8*/ A[ i ] =Tmp; } void Heapsort( ElementType A[ ], int N ) { int i; /* 1*/ for( i = N / 2 - 1; i >= 0; i-- ) /* BuildHeap */ /* 2*/ PercDown( A, i, N ); /* 3*/ for( i = N - 1; i > 0; i-- ) { /* 4*/ Swap( &A[ 0 ], &A[ i ] ); /* DeleteMax */ /* 5*/ PercDown( A, 0, i ); } } /* END */
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Fill the gaps :
#include <stdlib.h>
#include "fatal.h"
#include "heapsort.h"
void
Swap( ElementType *Lhs, ElementType *Rhs )
{
ElementType Tmp = *Lhs;
*Lhs = *Rhs;
*Rhs = Tmp;
}
/* START: fig7_8.txt */
void
PercDown( ElementType A[ ], int P, int N )
{
int Child, i;
ElementType Tmp;
Tmp = A[P];
/* 1*/ for( i = P; < N; i = Child )
{
/* 2*/ Child = ____________;
/* 3*/ if( Child != N - 1 && A[ Child + 1 ] > A[ Child ] )
/* 4*/ Child++;
/* 5*/ if( ___________ )
/* 6*/ A[ i ] = A[ Child ];
else
/* 7*/ break;
}
/* 8*/ A[ i ] =Tmp;
}
void
Heapsort( ElementType A[ ], int N )
{
int i;
/* 1*/ for( i = N / 2 - 1; i >= 0; i-- ) /* BuildHeap */
/* 2*/ PercDown( A, i, N );
/* 3*/ for( i = N - 1; i > 0; i-- )
{
/* 4*/ Swap( &A[ 0 ], &A[ i ] ); /* DeleteMax */
/* 5*/ PercDown( A, 0, i );
}
}
/* END */
Step by step
Solved in 2 steps
