Sorting algorithms/Bubble sort: Difference between revisions
Content deleted Content added
No edit summary |
|||
Line 3,125: | Line 3,125: | ||
NumberOfItems = NumberOfItems - 1 |
NumberOfItems = NumberOfItems - 1 |
||
Loop</lang> |
Loop</lang> |
||
=={{header|XPL0}}== |
|||
<lang XPL0>include c:\cxpl\codes; \intrinsic 'code' declarations |
|||
string 0; \use zero-terminated strings |
|||
proc BSort(A, N); \Bubble sort array in ascending order |
|||
char A; \address of array |
|||
int N; \number of items in array (size) |
|||
int I, J, T; |
|||
[for J:= N-1 downto 0 do |
|||
for I:= 0 to J-1 do |
|||
if A(I) > A(I+1) then |
|||
[T:= A(I); A(I):= A(I+1); A(I+1):= T]; \swap items |
|||
]; \BSort |
|||
func StrLen(Str); \Return number of characters in an ASCIIZ string |
|||
char Str; |
|||
int I; |
|||
for I:= 0 to -1>>1-1 do |
|||
if Str(I) = 0 then return I; |
|||
char Str; |
|||
[Str:= "Pack my box with five dozen liquor jugs."; |
|||
BSort(Str, StrLen(Str)); |
|||
Text(0, Str); CrLf(0); |
|||
]</lang> |
|||
Output: |
|||
<pre> |
|||
" .Pabcdeefghiiijklmnoooqrstuuvwxyz" |
|||
</pre> |
|||
=={{header|Yorick}}== |
=={{header|Yorick}}== |