The perfect sorting algorithm:
>O(n.log(n)) worst case runtime
>O(n) best case runtime with lists that are nearly sorted
>In-place
>Stable
Is there reason to think that the a sorting algorithm with these qualities doesn't exist or have we just not found it yet?
>O(n.log(n)) worst case runtime
>O(n) best case runtime with lists that are nearly sorted
>In-place
>Stable
Is there reason to think that the a sorting algorithm with these qualities doesn't exist or have we just not found it yet?
