1. 4
  1.  

  2. [Comment removed by author]

    1. 2

      ya, like that was the first thing I thought about when tim sort was brought up. In all reality that was a very minor bug found in the algorithm, and the author of that article probably specifically tried to use a controversial title to gain a lot of media attention. I guess it’s impressive the lengths they went through to find the exploit, but none the less minor. Here’s Tim Peters comment on the find: “However, I marked the priority "low” (the ticket) because, as the article also notes, there’s currently no machine in existence with enough memory to hold an array large enough for a contrived input to trigger an overflow of the pending-runs stack. "

      I’ve also been following Joshua Bloch for sometime, and I’m very amazed to see that he implements trendy sorting algorithms in his code.