Python Sort in Constant Space O(1)

I want to sort a list using Python 3in place with no extra space.

To my knowledge, Python sorts lists either using sorted(myList), which creates a new sorted array, obviously taking O(N) extra space. Or using myList.sort() which uses Timsort which also has a worst-case space complexity of O(N).

I searched through the documentations, but didn't find any built-in functions for a constant space algorithm (selection sort, insertion sort, shell sort, heap sort, cocktail sort, etc.)

I know I can find implementations for these algorithms, but a built-in hand-optimized implementation is the best I am hoping to find.

Any suggestion is appreciated.