How does Array#sort work when a block is passed?

In your example

a.sort

is equivalent to

a.sort { |x, y| x <=> y }

As you know, to sort an array, you need to be able to compare its elements (if you doubt that, just try to implement any sort algorithm without using any comparison, no <, >, <= or >=).

The block you provide is really a function which will be called by the sort algorithm to compare two items. That is x and y will always be some elements of the input array chosen by the sort algorithm during its execution.

The sort algorithm will assume that this comparison function/block will meet the requirements for method <=>:

• return -1 if x < y
• return 0 if x = y
• return 1 if x > y

Failure to provide an adequate comparison function/block will result in array whose order is undefined.

You should now understand why

a.sort { |x, y| x <=> y }

and

a.sort { |x, y| y <=> x }

return the same array in opposite orders.

To elaborate on what Tate Johnson added, if you implement the comparison function <=> on any of your classes, you gain the following

1. You may include the module Comparable in your class which will automatically define for you the following methods: between?, ==, >=, <, <= and >.
2. Instances of your class can now be sorted using the default (ie without argument) invocation to sort.

Note that the <=> method is already provided wherever it makes sense in ruby's standard library (Bignum, Array, File::Stat, Fixnum, String, Time, etc...).

When you have an array of, let's say, integers to sort, it's pretty straightforward for sort method to order the elements properly - smaller numbers first, bigger at the end. That's when you use ordinary sort, with no block.

But when you are sorting other objects, it may be needed to provide a way to compare (each) two of them. Let's say you have an array of objects of class Person. You probably can't tell if object bob is greater than object mike (i.e. class Person doesn't have method <=> implemented). In that case you'd need to provide some code to explain in which order you want these objects sorted to sort method. That's where the block form kicks in.

people.sort{|p1,p2| p1.age <=> p2.age}people.sort{|p1,p2| p1.children.count <=> p2.children.count}

etc. In all these cases, sort method sorts them the same way - the same algorithm is used. What is different is comparison logic.

@OscarRyz reply cleared up a lot for me on the question on how the sort works, esp

 { |x, y| y <=> x }

Based on my understanding I am providing here what the state of the array would be after each comparison for above block results.

Note: Got the reference of printing the values of block paramaters e1, e2 from ruby-forum

1.9.3dev :001 > a = %w(d e a w f k)1.9.3dev :003 > a.sort { |e1, e2| p [e2, e1]; e2 <=> e1 }["w", "d"]["k", "w"]["k", "d"]["k", "e"]["k", "f"]["k", "a"]["f", "a"]["d", "f"]["d", "a"]["d", "e"]["e", "f"] => ["w", "k", "f", "e", "d", "a"]

A guessed array state at runtime after each comparison:

 [e2, e1]    Comparsion Result       Array State["w", "d"]      1                   ["w", "e", "a", "d", "f", "k"]["k", "w"]     -1                   ["w", "e", "a", "d", "f", "k"]["k", "d"]      1                   ["w", "e", "a", "k", "f", "d"]["k", "e"]      1                   ["w", "k", "a", "e", "f", "d"]  ["k", "f"]      1                   ["w", "k", "a", "e", "f", "d"]    ["k", "a"]      1                   ["w", "k", "a", "e", "f", "d"]  ["f", "a"]      1                   ["w", "k", "f", "e", "a", "d"]  ["d", "f"]     -1                   ["w", "k", "f", "e", "a", "d"]  ["d", "a"]      1                   ["w", "k", "f", "e", "d", "a"]  ["d", "e"]     -1                   ["w", "k", "f", "e", "d", "a"]  ["e", "f"]     -1                   ["w", "k", "f", "e", "d", "a"] (Result)

Thanks,

Jignesh