From: tmoran@acm.org
Subject: Re: fastest data structure
Date: Wed, 11 Dec 2002 19:04:01 GMT
Date: 2002-12-11T19:04:01+00:00 [thread overview]
Message-ID: <B_LJ9.318906$QZ.47476@sccrnsc02> (raw)
In-Reply-To: at7k2o$9fb$1@news-reader10.wanadoo.fr
> running time seems depend on the record size....??
Perhaps the single element record is passed by copy in a register while
the larger records are passed by reference? What are the speeds of
your memory (cache?) and CPU - the array may need a multiply of some
sort, while the pointer may need a memory reference.
If this is actually significant in your application, perhaps you should
re-examine your algorithm and then code in hand-optimized assembly.
next prev parent reply other threads:[~2002-12-11 19:04 UTC|newest]
Thread overview: 13+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-12-10 21:01 fastest data structure Etienne Baudin
2002-12-10 22:12 ` Victor Porton
2002-12-11 1:14 ` Jeffrey Carter
2002-12-11 3:23 ` SteveD
2002-12-11 13:03 ` Marin David Condic
2002-12-11 15:02 ` Etienne Baudin
2002-12-11 15:11 ` Lutz Donnerhacke
2002-12-11 19:04 ` tmoran [this message]
2002-12-12 4:22 ` SteveD
2002-12-12 12:40 ` P R Keeble
2002-12-14 16:23 ` Simon Wright
2002-12-17 0:33 ` Randy Brukardt
-- strict thread matches above, loose matches on Subject: below --
2002-12-10 21:51 Gautier direct_replies_not_read
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox