Sorting algorithms

[qw23]

I started a topic about partial sorting, over one year ago.

Partial sorting

I would like to pick the first (n) sorted items from a large unsorted list (length: L), in a runtime-efficient manner. What I found to work, but not very efficiently, is a combination of two blocks: from the List utilities library: sort (data) ordering with (function); from the APL library: take (howmany) from (array). When combined, I call this algorithm A: take (n) from [sort (data) ordering with (function)]. Thus the list is fully sorted first, and subsequently the first (n) elements are…

The parameters have changed a bit ever since was introduced.