Minimum element value of a linked list
I am working through C in linked lists. I have been stumped on these two things. I have a structure that resembles :
Code:
typedef struct name
{
char *first;
char *last;
struct name *next;
} person;
with the structure variable : people;
person people *head,*tail * current;
now I need a small function that will find the smallest value of the list with the data:
current->first=John;
current->last=Marshall
current->first=Sam;
current->last=sneed;
current->first=Ann;
current->last=abercrombie;
and return a chart in the function minimum.
Code:
char minimum ( struct name min);
now how do I use a for construct to start at the second vale and iterate by 1 throughout the list?
I have a couple of sorts I am working on!
John