|
|
вернуться в форумSo why n^3 algo can finish in 0.078s? My state is f(n,k) so it's obviously a n^3 algo. And the code is very short. But it works fast... Why? Re: So why n^3 algo can finish in 0.078s? Bceause you can do almost 100*10^8 operations in 1 sec :) Re: So why n^3 algo can finish in 0.078s? Послано sylap 18 июн 2013 13:47 Are you sure ? 10 milliards ? or 100 millions ? |
|
|