Ordering- o = new Ordering
- () {
@Override
public int compare(Item left, Item right) {
return Ints.compare(left.price, right.price);
}
};
return o.max(list);
It's as efficient as it can be: it iterates through the items of the list, and returns the first of the Items having the maximum price: O(n).