From: Matthew Flatt (mflatt at cs.utah.edu) Date: Tue Apr 8 14:55:10 EDT 2008 |
|
At Tue, 8 Apr 2008 02:44:48 -0400, "Henk Boom" wrote: > On 07/04/2008, Matthew Flatt <mflatt at cs.utah.edu> wrote: > > Immutable hash-table update will be constant time. (Well, O(lg n), but > > the constant will be so small that it's effectively O(n).) Mutable > > hash-table update would be O(n). > > You mean "the constant will be so small that it's effectively O(1)," right? Right.
Posted on the users mailing list. |
|