I coded up a quick implementation of this in python, but in testing I found that... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

cldr on July 6, 2013 | parent | context | favorite | on: O(n) Sorting Algorithm: Quantum Bogosort

I coded up a quick implementation of this in python, but in testing I found that after the algorithm was done I actually wanted a shuffled list.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact