4 ms·
The real takeaway from this article is that O(n^2) and O(n!) algorithms are fine when your input size is 52 and 4.
by jrockway 13y ago
The real takeaway from this article is that O(n^2) and O(n!) algorithms are fine when your input size is 52 and 4.
- arnabdotorg 13y agoHaha, sure. Since this was a random fun project, the code was written with the objective function being "least amount of code to get the job done well enough" :)
- skeletonjelly 13y agoAs it should! Too often I get stuck in a rut, inspired by the myriad of articles I read about certain patterns and libraries, that I take too long to get a simple task done with my head in the wrong space. Good work! You can't refactor code you've haven't written.
- icefox 13y agoIn a similar vein, the complexity and suggested data structures for the input sizes: http://www.infoarena.ro/blog/numbers-everyone-should-know http://www.infoarena.ro/blog/numbers-everyone-should-know