This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug libstdc++/19422] assoc. containers: ctor taking range is O(n log n) even if the range is sorted
- From: "pinskia at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 13 Jan 2005 17:29:01 -0000
- Subject: [Bug libstdc++/19422] assoc. containers: ctor taking range is O(n log n) even if the range is sorted
- References: <20050113120525.19422.SWElef@post.sk>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From pinskia at gcc dot gnu dot org 2005-01-13 17:29 -------
Just a note, here is the fits of x/10000 vs ts:
The first time:
8.666+4.8264 x + 0.04201 x^2 - 0.0003 x^3
The second time:
5.628 + 1.19516 x - 0.0004 x^2 + 0.000127 x^3
So the second one is O(n) but the first is about O(n^2).
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=19422