Sort the letters of string in alphabetical order: Difference between revisions
Content added Content deleted
(Ada version) |
|||
Line 14: | Line 14: | ||
Write the function even if your language has a built-in function for it. |
Write the function even if your language has a built-in function for it. |
||
<br><br> |
<br><br> |
||
=={{header|Ada}}== |
|||
<lang Ada>with Ada.Text_Io; |
|||
with Ada.Containers.Generic_Array_Sort; |
|||
procedure Sort_Letters is |
|||
function Compare (Left, Right : Character) return Boolean |
|||
is (Left < Right); |
|||
procedure Sort is new |
|||
Ada.Containers.Generic_Array_Sort (Index_Type => Positive, |
|||
Element_Type => Character, |
|||
Array_Type => String, |
|||
"<" => Compare); |
|||
use Ada.Text_Io; |
|||
B : String := "When Roman engineers built a bridge, they had to stand under it while the first legion marched across. If programmers today worked under similar ground rules, they might well find themselves getting much more interested in Ada!"; |
|||
begin |
|||
Put_Line (B); Sort (B); Put_Line (B); |
|||
end Sort_Letters;</lang> |
|||
{{out}} |
|||
<pre>When Roman engineers built a bridge, they had to stand under it while the first legion marched across. If programmers today worked under similar ground rules, they might well find themselves getting much more interested in Ada! |
|||
!,,.AIRWaaaaaaaaaabbcccddddddddddddeeeeeeeeeeeeeeeeeeeeeeeeefffgggggggghhhhhhhhhhiiiiiiiiiiiiiikllllllllmmmmmmmmmnnnnnnnnnnnnnoooooooooprrrrrrrrrrrrrrrrssssssssssstttttttttttttttuuuuuuvwwwyyy</pre> |
|||
=={{header|ALGOL 68}}== |
=={{header|ALGOL 68}}== |