3 ms·
For giggles I did the math. n^3/2 * log(n)² The time required for 1000n is 3 million times more than n. If anyone makes a computer that is 6 orders of magnitu
by hinkley 4y ago
For giggles I did the math.
n^3/2 * log(n)²
The time required for 1000n is 3 million times more than n. If anyone makes a computer that is 6 orders of magnitude faster than current computers, none of us here will be alive to see it.