Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 21:01, 20 February 2024
, 2 months agoAdd sorting program in BLC
m (→{{header|Wren}}: Minor tidy) |
imported>Tromp (Add sorting program in BLC) |
||
Line 1,742:
<pre>Before: 4 65 2 -31 0 99 2 83 782 1
After: -31 0 1 2 2 4 65 83 99 782</pre>
=={{header|Binary Lambda Calculus}}==
As documented at https://github.com/tromp/AIT/blob/master/lists/sort.lam, the 436 byte BLC program
<syntaxhighlight>15 46 84 06 05 46 81 60 15 fb ec 2f 80 01 5b f9 7f 0b 7e f7 2f ec 2d fb 80 56 05 fd 85 bb 76 11 5d 50 5c 00 8b f3 ff 04 af fe 60 de 57 ff 30 5d 81 ff c2 dd 9a 28 20</syntaxhighlight>
sort a list of bitstrings (such as integers of a fixed bit-width) lexicographically.
=={{header|C}}==
| |||