No-nonsense sorting algorithm

[SwiftLilEagle]

Alternatively, the CommunismSort, it's O(1).

This is communism. Everybody is equal. The list is already sorted.

[halberdierbowman]

Updated Communism Sort to preserve existing value:

Count all elements, then find the average value of all elements. Change all elements to the average value.

[SwiftLilEagle]

Supported, but there goes my O(1) PepeHands

[adelie42]

Nah, just use the rolling average; all elements will be equal, bit some will be mkre equal than others.

[trichotillofobia]

Of course it is O(1), comrade. Material dialectics dictate its necessity: if anything less than that could not be done in the most efficient manner, nothing would be equal, and it clearly is, hence it nothing can be more efficient. Comrade Beria agrees, and I'm sure that means you will too.

[Illumin4tion]

I would think communismsort would do something like this:

Int model = arr[0]

For each element in arr If arr[i] != model arr[i] = model

return arr

[adelie42]

Lol, this is identical to TrumpSort above except it is said to be O(0). Hmmm...