Timsort is a sorting algorithm that is efficient for real-world data

Re:Timsort is a sorting algorithm that is efficient for real... by eesmith on Sunday July 01, 2018 @05:36PM (#17437758)

http://git.savannah.gnu.org/cgit/coreutils.git/tree/src/sort... says:

   Use a recursive divide-and-conquer algorithm, in the style
   suggested by Knuth volume 3 (2nd edition), exercise 5.2.4-23.  Use
   the optimization suggested by exercise 5.2.4-10; this requires room
   for only 1.5*N lines, rather than the usual 2*N lines.  Knuth
   writes that this memory optimization was originally published by
   D. A. Bell, Comp J. 1 (1958), 75.

[ Parent | on HN ]

There are no comments on this comment yet.