Answer:
NB : Suppose the list is unordered and elements can be compared between each other
element n = list[0]
FOR element tmp IN list
IF tmp SMALLER THAN n
THEN n = tmp
Step-by-step explanation:
In this case, our algorithm will pass through the whole list, element by element. We define n as the smallest element, and at the start, we define the first element as the smallest.
At each iteration, we compare the current element with the smallest one. If it is smaller than the current smallest element, then the current element will become the smallest element, and we will continue to iterate in the list until the end.
Once we reach the end, we are sure to have the smallest element in the list!