3 comments

  • deepsun36 minutes ago
    Cool, as a further research, I think it may be good for GPU&#x2F;SIMD. Because as a human you quickly see where is the boundary between groups, where to split. But our eyes are parallel to some degree, while computer needs to scan items one-by-one to find the boundary. But GPU is faster may do it in one call.<p>Glancing at the code it has three nested loops (two &quot;while&quot;s, and one &quot;reverse&quot; call), which makes it O(N^3) before optimizations.
  • TimorousBestie1 hour ago
    She makes a very good point that an algorithm that has bad big-O behavior can be better for humans than an algorithm with better.<p>For instance, I found insertion sort to be the most effective at sorting papers when I was grading. . . at least, as long as the students bothered writing their names on their homework.
  • engkimo3 days ago
    [dead]