12 ms·It's actually O(n) where n is ∞by jakemal 7y agoIt's actually O(n) where n is ∞pb7 7y agoYou know a O(n) sort algorithm?durovo 7y agoO(n) sort algorithms do exist (Counting sort)deleted 7y ago[deleted]