How to use linq to find the minimum [duplicate]

Answer 1

Have a look at the MinBy extension method in MoreLINQ (created by Jon Skeet, now principally maintained by Atif Aziz).

• MinBy documentation

• MinBy source code (it's pretty straightforward and has no dependencies on other files).

Answer 2

A little fold should do:

var minItem = items.Aggregate((acc, c) => acc.Score < c.Score? acc : c);

Ah... too slow.

Answer 3

Use Aggregate:

items.Aggregate((c, d) => c.Score < d.Score ? c : d)

As suggested, exact same line with more friendly names:

items.Aggregate((minItem, nextItem) => minItem.Score < nextItem.Score ? minItem : nextItem)

Answer 4

Try items.OrderBy(s => s.Score).FirstOrDefault();

Answer 5

The quick way as I see it would be implementing IComparable for your class A (if possible ofcourse)

class A : IComparable<A>

It's a simple implementation where you write the CompareTo(A other) have a look at IEnumerable(of T).Min on MSDN for a reference guide

Answer 6

This can be solved with a little simple iteration:

float minScore = float.MaxValue;
A minItem = null;

foreach(A item in items)
{
   if(item.Score < minScore)
       minItem = item;
}

return minItem;

It's not a nice LINQ query, but it does avoid a sorting operation and only iterates the list once, as per the question's requirements.