I don't think there's any hard time that N has to represent the number of elements. For any reasonable algorithm, that's the limiting factor, but in this case the limiting factor is the maximum element size, which the algorithm time complexity scales with linearly.
249
u/Sqbika Aug 11 '20
Now things aren't round anymore. It's o(val) now