[Python-ideas] Re: OT: Make list.reverse() more flexible

On Mon, Mar 08, 2021 at 04:59:26PM +0900, Stephen J. Turnbull wrote:

I'm curious: Many of the sorting algorithms I know use swap pairs of elements, but what sorting algorithm reverses segments longer than 3?

I have a feeling that Timsort may do that --- I believe it looks for either ascending or descending runs, sorts them, and reverses them if necessary. Of course I may be wrong. -- Steve