Sort the letters of string in alphabetical order: Difference between revisions

m
→‎{{header|Phix}}: (ok, it is probably an unoptimised bubble sort)
(→‎{{header|Haskell}}: Slightly rephrased the question in Haskell)
m (→‎{{header|Phix}}: (ok, it is probably an unoptimised bubble sort))
Line 139:
 
=={{header|Phix}}==
Not sure this algorithm actually ''has'' a name, but it certainly ain't the fastest, though it possibly ''is'' just about the shortest...<br><small>(If pressed I would dub this "Unoptimised bubble sort without the swapped flag")</small>
<!--<lang Phix>(phixonline)-->
<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>
7,820

edits