Rosetta Code

Sorting algorithms/Sleep sort: Difference between revisions

Page Discussion

Sorting algorithms/Sleep sort (view source)

Revision as of 22:38, 18 February 2020

33 bytes added ,  4 years ago
→‎{{header|Brainf***}}: edited explanation to make it easier to understand
(Add Emacs Lisp)
(→‎{{header|Brainf***}}: edited explanation to make it easier to understand)
Line 123:
]+<]<<<<]>>>>>[>>>>>]<]
</lang>
Not exactly 'sleep' sort but it is similar,: it inputs an array of digits and in each iteration reduces elements by 1. andWhen printsan theelement numberbecomes if0 result– isit 0prints the original digit.
 
Input: 1539\n
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/189172"