Anonymous user
Sorting algorithms/Bead sort: Difference between revisions
m
→{{header|Icon}} and {{header|Unicon}}: Use {{lines too long|Icon}} but also use Category:Unicon examples needing attention.
m (→{{header|Icon}} and {{header|Unicon}}: Use {{lines too long|Icon}} but also use Category:Unicon examples needing attention.) |
|||
Line 417:
=={{header|Icon}} and {{header|Unicon}}==
The program below handles integers and not just whole numbers. As are so many others, the solution is limited by the lack of sparse array or list compression.
{{lines too long|Icon}} [[Category:Unicon examples needing attention]]
<lang Icon>procedure main() #: demonstrate various ways to sort a list and string
write("Sorting Demo using ",image(beadsort))
| |||