On Mon, 26 Feb 2018, Sven Schreiber wrote:
 Perhaps the only thing where I'd like to know more is the 
 "recursion_quicksort" kind of thing. (Haven't really looked at the code
yet.) 
 In particular, is there some built-in gretl function that would normally be 
 used for this kind of task instead of writing a home-cooked hansl function? 
Yes. The quicksort algorithm is precisely what we use internally for all 
sorting, such as for example msortby().
-------------------------------------------------------
   Riccardo (Jack) Lucchetti
   Dipartimento di Scienze Economiche e Sociali (DiSES)
   Università Politecnica delle Marche
   (formerly known as Università di Ancona)
   r.lucchetti(a)univpm.it
   
http://www2.econ.univpm.it/servizi/hpp/lucchetti
-------------------------------------------------------