From: Florian Frank <flori@...>
Date: 2003-05-26T19:00:22+09:00
Subject: Re: Binary Tree vs. Hash

On 2003-05-26 18:29:23 +0900, Xiangrong Fang wrote:
> performance is unbearable. Does anyone know if ruby's internal
> Array.include? is using binary search or not?

No, it can't because arrays don't have to be sorted. "include?" is mixed
in by Enumerable which uses "each" to iterate over the elements.

-- 
4) "A TRUE Klingon Warrior does not comment his code!"
  -- Top 12 things likely to be overheard if you had a Klingon Programmer