The document explains a method to find the minimum element in an unsorted linked list by iterating through the list and comparing each element. The algorithm initializes the minimum value to the first element and continuously updates it if a smaller element is found. Pseudocode is provided to illustrate the algorithm's steps.

1. Given an unsorted linked list, how to find the minimum element?
Solution
it is simple to find the minium element in the unsorted array or linked list.
first you to look at all the elements of the linked list.
the alforithm is as follows:
minium=first element
repeat untill last position
{
if(minimum>next element)
minimum= next element
}
like this we compare all the elements in the linked list by updating the minimum element with
minimum value occured duiring the comparision.
the psudo code for this algorithm is
minimum=list_node->data;
while(list->next !=NULL)
{
if(minimum>list_node->data)
minimum=list_node->data;

2. list_node=list_node->link;
}
print minimum;