3 ms·Bead Sort: An O(1) Sorting Algorithm. [PDF]2 points by nickb 18y agobayareaguy 18y agoThis is cute but it's only "O(1)" if you have hardware that supports the parallel "drop" operation and you represent your data in base-1.