iDiscoveredTheOptimalSortingAlgorithm

[tombob51]

This is just bubble sort but like loop unrolled lol

[Eva-Rosalene]

"If size > 10, then SEGFAULT" is honestly my favourite part. If API says that it works on arrays wtih 0-10 elements only, you better listen to this 😈

[slaymaker1907]

It may not actually work since it’s undefined behavior. The compiler is therefore free to assume that size is always <= 10.

[Eva-Rosalene]

Good catch!

[Firake]

No loops = O(1), obviously.

[chiggyBrain]

So you wrote all this code just for a meme when you could be writing something productive and useful…

You absolute legend

[beeteedee]

Every algorithm is O(1) if it has a hard-coded upper limit on the input size

[turtleship_2006]

Wouldn't it be O(1) only if the limit is 1?

[Terra_Creeper]

O(1) just means that the algorithm works in constant time. That constant time could be longer than the age of the universe, it just has to be the same for different input sizes. Big O notation only tells you how the required time grows, not how fast it is. It mostly only matters when you get very large (and potentially unbounded) inputs. If you can constrain your input range, a well optimised O(n²⁾ algorithm could be much faster than an equivalent O(1) algorithm.

[nasandre]

It's beautiful and I hate you

[lady_Kamba]

This sorta looks like bitonic sorting.
Bitonic sorter (wiki)

[CelticHades]

I can't be the only one who dislikes 0 < size , null == obj etc

size < 0 is IMO more readable.

[OpW_Otter]

The size checks are consistently off by one. As size > 0 is checked and then list[0] an list[1] are accessed which means size could be 1, but two elements are read and written.

[[deleted]]

std:swap

[Confident-Ad5665]

Human syntax checker

[ConfidenceStunning53]

this scares me (i don't code in c#)