delorie.com/archives/browse.cgi | search |
Newsgroups: | comp.os.msdos.djgpp |
From: | manni DOT heumann AT gmx DOT de (Manni Heumann) |
Subject: | Re: map<string,int>.find |
References: | <fDg34.64720$I5 DOT 536554 AT news1 DOT rdc1 DOT bc DOT home DOT com> |
X-Newsreader: | News Xpress 2.01 |
Date: | Wed, 08 Dec 1999 10:24:07 GMT |
NNTP-Posting-Host: | dhcp33-114.uni-bielefeld.de |
Message-ID: | <384e31d1@news.uni-bielefeld.de> |
X-Trace: | 8 Dec 1999 11:24:17 +0200, dhcp33-114.uni-bielefeld.de |
Lines: | 23 |
To: | djgpp AT delorie DOT com |
DJ-Gateway: | from newsgroup comp.os.msdos.djgpp |
Reply-To: | djgpp AT delorie DOT com |
In article <fDg34.64720$I5 DOT 536554 AT news1 DOT rdc1 DOT bc DOT home DOT com>, "Shaun Jackman" <sjackman AT home DOT com DOT antispam> wrote: >What kind of execution time can I expect from the STL map<string,int>.find >member? >Linear search? >Binary search? >Constant time? (hash table) > >Thanks, >Shaun > > > Quote: "Average complexity for find is at most logarithmic." from http://www.sgi.com/Technology/STL/AssociativeContainer.html I know that Stroustrup also discusses this in his book "The C++ programming language", but I don't have it here. -- Manni
webmaster | delorie software privacy |
Copyright © 2019 by DJ Delorie | Updated Jul 2019 |