Sort the letters of string in alphabetical order: Difference between revisions
Content added Content deleted
(Added Algol W) |
No edit summary |
||
Line 416: | Line 416: | ||
<pre> |
<pre> |
||
" .Naaccddeeeeeeffghhhiiiillmmmnnooooooooorrrstttttttuwy" |
" .Naaccddeeeeeeffghhhiiiillmmmnnooooooooorrrstttttttuwy" |
||
</pre> |
|||
=={{header|Delphi}}== |
|||
{{works with|Delphi|6.0}} |
|||
{{libheader|SysUtils,StdCtrls}} |
|||
Uses Delphi TStringList component to do most of the heavy lifting. The TStringList is designed to hold and maniputlate strings. In the strings are one character long so it sorts characters from the strings. |
|||
<syntaxhighlight lang="Delphi"> |
|||
function SortStringLetters(S: string): string; |
|||
{Extract letters from string and sort them} |
|||
{Uses string list component to hold and sort chars} |
|||
var SL: TStringList; |
|||
var I: integer; |
|||
begin |
|||
SL:=TStringList.Create; |
|||
try |
|||
for I:=1 to Length(S) do SL.Add(S[I]); |
|||
SL.Sort; |
|||
SetLength(Result,SL.Count); |
|||
for I:=0 to SL.Count-1 do |
|||
Result[I+1]:=SL[I][1]; |
|||
finally SL.Free; end; |
|||
end; |
|||
const S1 = 'Now is the time for all good men to come to the aid of the party.'; |
|||
const S2 = 'See the quick brown fox jump over the lazy dog.'; |
|||
procedure ShowSortedLetters(Memo: TMemo); |
|||
var S: string; |
|||
begin |
|||
Memo.Lines.Add('Unsorted = '+S1); |
|||
Memo.Lines.Add('Sorted = '+SortStringLetters(S1)); |
|||
Memo.Lines.Add('Unsorted = '+S2); |
|||
Memo.Lines.Add('Sorted = '+SortStringLetters(S2)); |
|||
end; |
|||
</syntaxhighlight> |
|||
{{out}} |
|||
<pre> |
|||
Unsorted = Now is the time for all good men to come to the aid of the party. |
|||
Sorted = .aaacddeeeeeeffghhhiiillmmmNnooooooooprrstttttttwy |
|||
Unsorted = See the quick brown fox jump over the lazy dog. |
|||
Sorted = .abcdeeeeefghhijklmnoooopqrrSttuuvwxyz |
|||
Elapsed Time: 5.996 ms. |
|||
</pre> |
</pre> |
||