From: Max Williams <toastkid.williams@...>
Date: 2009-09-02T17:30:46+09:00
Subject: Re: Nice algorithm for 'spreading' indexes across an array?

Thanks, everyone.  Harry, i like your solution but i thought of a way to 
tweak it in a way which seems more readable, to me at least:

class Array
  def spread(num)
    discarded = []
    (1..(size-num)).each{|u| discarded << self[size*u/(size-num+1)]}
    self - discarded
  end
end

The clever bit is of course line 4.  I'm still trying to work out why 
that works :)

-- 
Posted via http://www.ruby-forum.com/.