19 Jun
2012
19 Jun
'12
4:14 p.m.
Insert a big sorted sequence in a std::set is more faster than insert an unordered sequence, due to the cache performance. The potencial benefits in an small sequence disappear when the sequence grows. In a std::set <uin64_t> , inserting 30.000.000 elements, sorted elements : 29.98 secs unordered elements : 53.57 secs Regards Francisco Tapia