Finding an interval in a sorted array?

ruby-talk
1

<snip>

Here's my solution. It may be naive, but it passes your tests:

class Array
   def interval_containing(num)
      return [max] if num >= self.max
      return [min] if num <= self.min
      values_at((num.floor)..(num.ceil))
   end
end

C:\>ruby test.rb
Loaded suite test
Started
.
Finished in 0.0 seconds.

1 tests, 7 assertions, 0 failures, 0 errors

This communication is the property of Qwest and may contain confidential or
privileged information. Unauthorized use of this communication is strictly
prohibited and may be unlawful. If you have received this communication
in error, please immediately notify the sender by reply e-mail and destroy
all copies of the communication and any attachments.

···

-----Original Message-----
From: Bil Kleb [mailto:Bil.Kleb@nasa.gov]
Sent: Friday, May 05, 2006 11:26 AM
To: ruby-talk ML
Subject: Finding an interval in a sorted array?

Hello,

Surely there is a way to find an interval in a sorted array
without resorting to indices? (I'm drawing a blank.)