Remove minimum value from linkedlist [closed]

Answer 1

If your question is how to remove the minimum Element of a list where the elements are of a generic type T, then you should do the following:

1. you need to have a comparator by which you can compare the elements to find the minimum
2. you have to iterate over the list to find that minimum element
3. you have to remove this element from the list.

Answer 2

You can do like this :

public void RemoveMin()
{
   int nbElements = list.size()
   int lowerValueIndex = 0
   for (i = 0; i < nbElements; i++)
   {
      if(list.get(i) < list.get(lowerValueIndex)
      {
         lowerValueIndex = i;
      }
   }
   list.remove(lowerValueIndex);
}

First you initializethe lowest value with the first element. Then at each element, you compare the value with the lower one who is already find. if the new is lower, you take the new lowerValueIndex. At the end you just have to remove the lowest element founded. Be carefull, with this solution, your data must be comparable directly