|
<![CDATA[
list delete( pq )
list pq;
{struct rec r;
list p, max;
if (pq==NULL) Error /*** Deleting from empty PQ ***/;
else {r.next = pq;
max = &r;
for (p=pq; p->next != NULL; p=p->next)
if (max->next->k <p->next->k) max = p;
max->next = max->next->next;
return( r.next );
}
};
]]> |
![[Home]](../../images/home_g.gif)
![[Contents]](../../images/contents_g.gif)
![[Chapter]](../../images/chapter_g.gif)
![[Previous Algorithm]](../../images/prevalg_g.gif)
![[Next Algorithm]](../../images/nextalg_g.gif)
C source (511b.del.c) 