xkcd.com

<< Back to the feed

Linear Sort

Actions: [ Mark as unread ] [ Delete article ][ << Older article ] [ Newer article >> ]
Original URL: https://xkcd.com/3026/

The best case is O(n), and the worst case is that someone checks why.

Posted on:2024-12-18 05:00:00

Still in Beta stage. Source on GitHub.