Is there is any sorting algorithm except(bubble/insertion) which is both stable and in-place?
I know heap sort and quick sort are in-place but they are not stable, and merge sort is stable but not in-place.
I know we can make quick/heap sort stable but it take O(n) extra space. I am looking for something that is by nature stable and in-place and not have O(n) space penalty to make it stable!
Bubble and insertion sort are useless for large arrays.