Sorting algorithms/Bubble sort: Difference between revisions

(Updated D code)
Line 195:
{{trans|Java}}
Assume numbers are in a DIM of size "size" called "nums".
<lang qbasic>DO
DO
changed = 0
for FOR I = 1 to size -1
IF nums(I) > nums(I + 1) THEN
tmp = nums(I)
nums(I) = nums(I + 1)
nums(I + 1) = tmp
changed = 1
END IF
NEXT
LOOP WHILE(NOT changed)</lang>
 
Anonymous user