Sort a list of objects by using their attributes in Ruby

Question

I have a list of Fruit structs called basket. Each Fruit struct has a name (a string) and a calories (an integer). I would like to sort basket so that:

1. The Fruits with the highest calories appear first. For example, a fruit with 500 calories appears before a fruit with 400 calories.

2. If two Fruits have equal calories, the Fruit whose name comes first alphabetically comes first, ignoring case. For example, given two fruits with equal calories, one named "banana" will come before one named "Citrus".

The definition of Fruit is not something I control so I'd prefer a solution which doesn't involve mixing anything into Fruit or changing it. Is this possible?

Answer 1

The easy solution is

basket.sort_by { |f| [-f.calories, f.name] }

Of course, if this is the canonical sort order for fruit then it should be defined using the <=> method and with the Comparable module mixed into Fruit

Answer 2

Let's assume that your basket is an Array or a subclass thereof.

The Fast Way

Enumerable.sort_by

As Gareth pointed out, Enumerable (included by Array) has a sort_by method that runs through each list item once. This is faster to run and faster to write once you get the hang of it.

# -f.calories to sort descending
# name.downcase to do a case-insensitive sort
basket = basket.sort_by { |f| [-f.calories, f.name.downcase] }

The Perl Way

Array.sort

Coming from a Perl background, my first impulse is to grab the spaceship operator <=>. Cheeky little devil. Array has the sort and sort! methods that make it very useful. This solution is slower, and because it's longer it is more likely to introduce bugs. The only reason to use it is if you're dealing with people unfamiliar with Ruby and unwilling to find the right way on StackOverflow.

baseket.sort! { |a,b|
  if a.calories == b.calories
    a.name.downcase <=> b.name.downcase
  else
    # Reverse the result to sort highest first.
    -(a.calories <=> b.calories)
  end
}