For the github badge.

[Xondamirxon]

You are tasked with creating an infinitely efficient algorithm for sorting an array of
𝑛
n integers. The algorithm must meet the following criteria:

The time complexity must be
𝑂(1)
O(1) for all possible inputs.
The space complexity must be
𝑂(1)
O(1).
The algorithm must work deterministically for any possible input.
You are not allowed to make any assumptions about the input distribution or leverage hardware-specific optimizations.

[abdurahmon27]

Sorting Algorithm Complexity Lower Bound: The known lower bound for comparison-based sorting algorithms is
𝑂(𝑛log𝑛)
O(n log n). Achieving
𝑂(1)
O(1) time complexity universally is mathematically impossible unless
𝑃=𝑁𝑃
P=NP, which is one of the biggest open problems in computer science.
Space Complexity Constraint: Maintaining
𝑂(1)
O(1) space implies that the algorithm cannot use additional memory beyond a constant amount, making tasks like swapping elements impossible for inputs larger than a fixed size without breaking the space constraint.
Deterministic Behavior: Randomized algorithms like QuickSort (with random pivots) can achieve faster performance on average, but these violate the deterministic requirement.