Sorting algorithms/Tree sort on a linked list: Difference between revisions
Sorting algorithms/Tree sort on a linked list (view source)
Revision as of 20:09, 28 August 2015
, 8 years ago→{{header|J}}
m (→{{header|J}}) |
m (→{{header|J}}) |
||
Line 35:
We have to swap almost every sentence, but 16 of them can be sorted "for free" with the swaps of the other sentences.
For that matter, inspecting the lengths of the cycles formed by the minimal arrangements of swaps...
<lang J> /:~ #@>C./:sentences
| |||