(no subject)

From: Sebastien Ducamp (Sebastien.Ducamp++at++kxen.com)
Date: 09/10/2001 09:01:38

• Next message: Marcin Romaszewicz: "Do not upgrade nVidia linux drivers to v1.0-1512"
• Previous message: Robert Nitti: "shared memory area too close to the heap"
• Next in thread: Hsu-hua Chen: "(no subject)"

Hello,
I have a question about the scalability and the complexity of the algorithm
for associative containers.
To compare the performance of these latter, I made some benchmarks and I
observe strange results :
with the rise of the insertion in the containers, the time is risen
exponentially. However, as indicate in the documentation, the complexity is
Olog(N).
I join the graph I made with the results.
On the x-axis, you will find the number of elements I try to insert ( here :
strings whose the mean size is 25), and on the y-axis, you will find the
time in secondes.
Please let me know your remarks and tell me if the results appears to be
"normal" ...
It will be very helpful !
(
Environnement information :
Pentium III 866Mhz
128Mo RAM
STL 3.3
)
Best regards
Sébastien Ducamp
 <<STL Benchmark.xls>>

• application/vnd.ms-excel attachment: STL_Benchmark.xls

• Next message: Marcin Romaszewicz: "Do not upgrade nVidia linux drivers to v1.0-1512"
• Previous message: Robert Nitti: "shared memory area too close to the heap"
• Next in thread: Hsu-hua Chen: "(no subject)"

This archive was generated by hypermail 2b29 : Mon Sep 10 2001 - 09:04:56 PDT

This message has been cleansed for anti-spam protection. Replace '++at++' in any mail addresses with the '@' symbol.