Sorting algorithms/Bubble sort: Difference between revisions

No edit summary
Line 614:
 
==={{header|IS-BASIC}}===
<lang IS-BASIC>100 PROGRAM "BubblSrt.bas"
100 PROGRAM "BubblSrt.bas"
110 RANDOMIZE
120 NUMERIC ARRAY(-5 TO 9)
120 LET N=20 ! Number of elements
130 NUMERICCALL INIT(ARRAY(1 TO N)
140 CALL INITWRITE(ARRAY)
150 CALL WRITEBUBBLESORT(ARRAY)
160 CALL BUBBLESORTWRITE(ARRAY)
170 CALLDEF WRITEINIT(ARRAYREF A)
180 DEF INIT FOR I=LBOUND(REFA) TO UBOUND(A)
190 FOR LET A(I)=LBOUNDRND(A) TO UBOUND(A98)+1
200 LET A(I)=RND(N)+1NEXT
210 END NEXTDEF
220 END DEF WRITE(REF A)
230 DEF WRITE FOR I=LBOUND(REFA) TO UBOUND(A)
240 FOR I=LBOUND(A) TOPRINT UBOUNDA(AI);
250 PRINT A(I);NEXT
260 NEXTPRINT
270 END PRINTDEF
280 END DEF BUBBLESORT(REF A)
290 DEF BUBBLESORT(REF A)DO
300 DO LET CH=0
310 LETFOR CHI=0LBOUND(A) TO UBOUND(A)-1
320 FOR I=LBOUND IF A(I)>A(I+1) TOTHEN UBOUNDLET T=A(I):LET A(I)-=A(I+1):LET A(I+1)=T:LET CH=1
330 NEXT
330 IF A(I)>A(I+1) THEN LET T=A(I):LET A(I)=A(I+1):LET A(I+1)=T:LET CH=1
340 LOOP WHILE NEXTCH
350 END LOOP WHILE CHDEF</lang>
360 END DEF</lang>
 
=={{header|C}}==
Anonymous user