# Re: Finding an interval in a sorted array?

**URL:** <https://www.ruby-forum.com/t/re-finding-an-interval-in-a-sorted-array/94527>\
**Category:** Ruby\
**Created:** [May 5, 2006, 8:56pm UTC](https://www.ruby-forum.com/t/re-finding-an-interval-in-a-sorted-array/94527 "2006-05-05T20:56:45Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![BergerS\_Daniel](https://www.ruby-forum.com/letter_avatar_proxy/v4/letter/b/bc8723/32.png) [@BergerS\_Daniel](https://www.ruby-forum.com/u/BergerS_Daniel)\
**Post date:** [May 5, 2006, 8:56pm UTC](https://www.ruby-forum.com/t/re-finding-an-interval-in-a-sorted-array/94527/1 "2006-05-05T20:56:45Z")

</div>

> without resorting to indices? (I’m drawing a blank.)

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.