From: "Radosław Bułat" <radek.bulat@...>
Date: 2011-02-26T04:32:14+09:00
Subject: Re: Are Hash speeds documented?

On Fri, Feb 25, 2011 at 5:57 PM, Nick Brown <nick@nick-brown.com> wrote:
> Are the lookup, insertion, deletion, and sort costs of Hash objects
> documented anywhere? I would be interested in average-case
> and worst-case times... are they linear, logarithmic, exponential, etc.
> in time?

Lookup, insertion, deletion -> O(1)
Sort -> O(N * logN)

-- 
Pozdrawiam

Radosław Bułat
http://radarek.jogger.pl - mój blog