1. 21
  1.  

  2. 29

    Timsort: A very fast , O(n log n), stable sorting algorithm built for the real world — not constructed in academia.

    I hope the article presents not the original version but the one that was fixed by academia.

    (See https://ercim-news.ercim.eu/en102/r-i/fixing-the-sorting-algorithm-for-android-java-and-python, https://link.springer.com/chapter/10.1007/978-3-319-21690-4_16)

    1. 10

      I hope so too, that’s a weird anti-intellectual statement to make to open a post about an idea.

      1. 10

        This guy used to post a lot of his lessons on lobsters and most of them had pretty glaring mistakes, like saying an O(2^n) algorithm was faster than a linear one, so I’m not surprised.

        1. 1

          Aye ya yaye… Sounds like they’re trying to reinforce by recall but at the same time feel good about themselves maybe…

        2. 3

          Being pro-pragmatism isn’t the same as anti-intellectual. “Academia” means different things to different people also, of course

          1. 1

            I was a bit surprised by the tone of this sentence, to say the least. Glad I’m not the only one!

        3. 11

          This was previously submitted 2 years ago: https://lobste.rs/s/crfy2d/timsort_fastest_sorting_algorithm_you_ve (17 comments).

          The URLs are different so the dupe detector didn’t fire.