struct link {
int data;
struct *prior,*next;
};
int min_link( struct link *head )
{
struct link *p=head ; //无头结点的表
int min=0;
do
{
if ( p->data < min )
min=p->data;
p=p->next;
} while( p&&p!=head);
return min;
}
void findmin(LNode *a, int &min)
{
LNode *p = a->next;
int tmp = INT_MAX;
while(p)
{
if(p->data < tmp)
tmp= p->data;
p=p->next;
}
min = tmp;
}