news
25

A reader discussion revisits the counterintuitive “I Can’t Believe It Can Sort” algorithm, which appears flawed but is proven to sort correctly despite unnecessary pairwise comparisons and Θ(n²) runtime in all cases. Commenters note it is impractical, unstable, and offers little beyond simplicity, while linking formal proofs and SPARK verification efforts. The thread also touches on toy algorithms like sleep sort as fun but unusable curiosities.

Only full members can comment

Log in to express your opinion.

No comments yet.