On Thu, May 18, 2006 8:57 am, tedd wrote:
> However, binary-trees are for searching and I use MySQL for that. I
> don't know specifically how MySQL preforms searches. I had hoped that
> somewhere one could set a bit and change the algorithms, but I
> haven't been able to find any references that al
On Thu, 2006-05-18 at 06:41, Andrew Brampton wrote:
> Hi,
>
> In the past few weeks I've found the need for a hash table and a container
> that gives me O(log) search efficiency. Now I'm aware I can use associative
> arrays for my hash table, but I wanted to ensure efficiency. For my O(log)
> c
At 11:41 AM +0100 5/18/06, Andrew Brampton wrote:
Hi,
In the past few weeks I've found the need for a hash table and a
container that gives me O(log) search efficiency. Now I'm aware I
can use associative arrays for my hash table, but I wanted to ensure
efficiency. For my O(log) container I e
Andrew Brampton wrote:
Hi,
In the past few weeks I've found the need for a hash table and a
container that gives me O(log) search efficiency. Now I'm aware I can
use associative arrays for my hash table, but I wanted to ensure
efficiency. For my O(log) container I ended up using a sorted arra
4 matches
Mail list logo
