SeaJay
Re:Optimizing Inefficiency: the quest for the worst sorting algorithm
on Thursday April 18, 2019 @08:45AM (#19690555)
Yeah, it's O(N) in air and O(sqrt(N)) in a vacuum. The O(1) thing assumes all the beads move simultaneously in the same time unit, which isn't possible in practice of course.