Le 21/09/2022 à 10:10, Thomas Morley a écrit :
There's also:
https://lsr.di.unimi.it/LSR/Item?id=763
Thanks for the link! I didn't know that snippet.
Just a note: at some point there is
(set! index-item-list
;; We insert index items sorted from the beginning on and do
;; not sort them later - this saves pretty much computing time
(insert-alphabetical-sorted! (list label markup-symbol text sorttext)
index-item-list))
This is unlikely to save computing time, since it's doing an
insertion sort, O(n^2), where as Guile's sort function (and
any optimal sort algorithm) is O(n (log n)).
Cheers,
Jean
