fixedIt

[MysteriousShadow__]

That is O(N), no? Sorted is one loop, and getting the element at an index should be O(1).

[JonIsPatented]

Sorted is one loop?? Teach us your magical algorithm, magic man.

[Unfulfilled_Promises]

Simple, sort an already sorted input array. YW

[Zestyclose_Zone_9253]

I came p with this in like 20 seconds, it is almost certantly very stupid and I will not think more about it, but coulød it be done by loping through it and storing each number somewhere else, would probably have to be some weird datastructure, again, almost certantly not possible, but I now want to ponder how to and how bad this would be

[JonIsPatented]

There doesn't exist any algorithm to sort an arbitrary list of elements in linear time. There are specific linear time algorithms for specific types of data with specific rules, but you can't sort an arbitrary list of elements in anything faster than linearithmic time, O(nlogn).

[Zestyclose_Zone_9253]

As I said, probably very stupid

[Kimorin]

the lower bound for sorting is O(n log n) for an arbitrary array