Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 05:43, 3 September 2014
, 9 years agoAdded zkl
(→{{header|jq}}: link to Binary search page) |
(Added zkl) |
||
Line 2,059:
}
}</lang>
=={{header|zkl}}==
<lang zkl>fcn insertionSort(list){
sink:=List();
foreach x in (list){
if(False==(n:=sink.filter1n('>(x)))) sink.append(x); // x>all items in sink
else sink.insert(n,x);
}
sink.close();
}</lang>
<lang zkl>insertionSort(T(4,65,2,-31,0,99,2,83,782,1)).println();
insertionSort("big fjords vex quick waltz nymph".split()).println();</lang>
{{out}}
<pre>
L(-31,0,1,2,2,4,65,83,99,782)
L("big","fjords","nymph","quick","vex","waltz")
</pre>
{{omit from|GUISS}}
| |||