Sorting algorithms

[insert_user_name]

This topic is for discussing sorting algorithms, or maybe even making your own.
There would be more information here, but I can't currently think of anything else to say.

[polymations]

Mean Sort

[loucheman]

Sleep sort

Only positive integers (for safety results) can be sorted with this sorting algorithm

It's just a funny algorithm !

The concept here is that you 'sleep' n units of time for each element, where n is linearly related to the lexical relationship of the element to the other elements in the list. see here

[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.

[loucheman]

Bogosort

For fun purpose only

algo: shuffle the list until it is sorted...

wikipedia