Is `heapq.merge` stable?

[dg-pb]

I propose a new challenge.

A "sorted" that returns a generator (mine implemented with quicksort)

I propose a challenge. - “Perfect iterator sorting algorithm in Pure Python”. Such would inevitably need to hold all of the data at initialisation. Preconditions: Needs to release returned values as soon as possible Goodness criteria: Runtime should be distributed across iterations as uniformly as possible Initialisation time as low as possible. Ideally, it should be less than 10% of sorted(arr). See below: Total runtime as low as possible (this is the least important) Test cases: def e…