[HN Gopher] JesseSort: A novel sorting algorithm that is faster ...
       ___________________________________________________________________
        
       JesseSort: A novel sorting algorithm that is faster than Python's
       default sort.
        
       Author : amichail
       Score  : 23 points
       Date   : 2025-02-13 20:27 UTC (2 hours ago)
        
 (HTM) web link (github.com)
 (TXT) w3m dump (github.com)
        
       | hinkley wrote:
       | So for those of us who aren't hanging on every update in the
       | Python universe, what _is_ the default sort in Python now? All I
       | recall is that Timsort got dethroned and the author seems to be
       | behaving like it's some big secret to be kept from the plebs.
       | 
       | Edit: all the way at the bottom of page 6: timsort+powersort
        
         | vanderZwan wrote:
         | Powersort is pretty neat, here's a blog post with links to
         | talks about it by one of the authors:
         | 
         | https://www.wild-inter.net/posts/powersort-in-python-3.11
        
       | pinoy420 wrote:
       | Why is this implemented _in_ python? Is it compiled some how?
        
       | vanderZwan wrote:
       | Interesting approach, although I'm wonderin. why they didn't just
       | use a double-ended queue instead of a linked list.
       | 
       | Also, I get the urge to name the algorithm after yourself, since
       | Timsort is named after its creator as well, but if you call you
       | data structure "rainbow" then my first association would be the
       | rainbow flag, since flag-sorts also have a tradition in sorting
       | algorithm names.
       | 
       | [0] https://en.m.wikipedia.org/wiki/Dutch_national_flag_problem
       | 
       | [1] https://en.m.wikipedia.org/wiki/American_flag_sort
        
       ___________________________________________________________________
       (page generated 2025-02-13 23:00 UTC)