Has it been considered to replace the use of shell.f90 (a shellsort) that
fully sorts before finding the kth element? The quickselect algorithm is
much faster as it does only a partial partitioning of the data to find the
kth element.
Jim Record
*AD0YO*
------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
wsjt-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/wsjt-devel
