Quadratic time to sort in a simple case?

Dmitry Olshansky dmitry.olsh at gmail.com
Fri Apr 19 14:44:23 PDT 2013


20-Apr-2013 01:03, Ivan Kazmenko пишет:
>
> With n = 30_000 as in the example, this takes time of the order of a
> second on a modern computer, which is clearly O(n^2).  I am using DMD
> 2.062.

Optimization flags if any?


-- 
Dmitry Olshansky


More information about the Digitalmars-d-learn mailing list