Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Learn Big O ITT

Name: Anonymous 2015-04-29 14:44

* O(2^n) very very slow
* O(n^2) pretty slow...
* O(n log n) nice and efficient
* O(n) very fast
* O(1) instant

Name: Anonymous 2015-04-29 15:06

O(1) is not instant.

It could take a year for O(1) algorithm where O(2^n) algorithm could take milliseconds.

Newer Posts