April 28, 2011
2:22 p.m.
On Thu, Apr 28, 2011 at 10:01 AM, Steven D'Aprano <steve@pearwood.info> wrote:
I think I would like to see a demonstration of this rather than just take your word for it.
One demonstration would be def bubble_sort(xs): while True: changed = False for i in range(len(xs) - 1): if not (xs[i] < xs[i + 1]): changed = True xs[i], xs[i + 1] = xs[i + 1], xs[i] if not changed: break bubble_sort([float('nan)'] * 2)