Re: Quadratic time to sort in a simple case?

Fri, 19 Apr 2013 14:45:23 -0700 

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























					Reply via email to