Jim --
On 12/20/2017 11:19 PM, Jim Record wrote:
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
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*
