Re: Teaching new tricks to an old dog (C++ -->Ada)
From: Georg Bauhaus (bauhaus_at_futureapps.de)
Date: 03/22/05
- Next message: Georg Bauhaus: "Re: Teaching new tricks to an old dog (C++ -->Ada)"
- Previous message: Dmitry A. Kazakov: "Re: Ada bench : count words"
- In reply to: Ioannis Vranos: "Re: Teaching new tricks to an old dog (C++ -->Ada)"
- Next in thread: Ioannis Vranos: "Re: Teaching new tricks to an old dog (C++ -->Ada)"
- Reply: Ioannis Vranos: "Re: Teaching new tricks to an old dog (C++ -->Ada)"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Tue, 22 Mar 2005 22:55:01 +0100
Ioannis Vranos wrote:
> Georg Bauhaus wrote:
> I forgot to say here that the cost of map's operator[] is O(log(n))
> which is fairly cheap for large amount of data.
compare O(log(n)) to O(1) where n is 1, 1000, 1_000_000.
Make this access a part of an inner loop.
Georg
- Next message: Georg Bauhaus: "Re: Teaching new tricks to an old dog (C++ -->Ada)"
- Previous message: Dmitry A. Kazakov: "Re: Ada bench : count words"
- In reply to: Ioannis Vranos: "Re: Teaching new tricks to an old dog (C++ -->Ada)"
- Next in thread: Ioannis Vranos: "Re: Teaching new tricks to an old dog (C++ -->Ada)"
- Reply: Ioannis Vranos: "Re: Teaching new tricks to an old dog (C++ -->Ada)"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|