Ary Borenszweig wrote:
I think Bill speaks about a stable sort. You can have an unstable sort algorithm without having explicity a random invocation. Note that he's saying "leads to results that differ from run-to-run when there are elements with identical keys".
And I believe that the sort implementation is completely deterministic. If Bill is getting different results from different runs, something else is going on.
