Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
no edit summary
No edit summary |
|||
Line 361:
</pre>
==={{header|BBC BASIC}}===
Note that the array index is assumed to start at zero.
<lang bbcbasic> DIM test(9)
Line 389:
</pre>
==={{header|Commodore BASIC}}===
<lang basic>
10 DIM A(10): N=9
Line 400:
50 PRINT: FOR I=0 TO N: PRINTA(I): NEXT: RETURN
</lang>
==={{header|IS-BASIC}}===
<lang IS-BASIC>100 PROGRAM "InserSrt.bas"
110 RANDOMIZE
120 LET N=20 ! Number of elements
130 NUMERIC ARRAY(1 TO N)
140 CALL INIT(ARRAY)
150 CALL WRITE(ARRAY)
160 CALL INSERTSORT(ARRAY)
170 CALL WRITE(ARRAY)
180 DEF INIT(REF A)
190 FOR I=LBOUND(A) TO UBOUND(A)
200 LET A(I)=RND(N)+1
210 NEXT
220 END DEF
230 DEF WRITE(REF A)
240 FOR I=LBOUND(A) TO UBOUND(A)
250 PRINT A(I);
260 NEXT
270 PRINT
280 END DEF
290 DEF INSERTSORT(REF A)
300 FOR J=2 TO N
310 LET I=J-1:LET SW=A(J)
320 DO WHILE I>0 AND SW<A(I)
330 LET A(I+1)=A(I):LET I=I-1
340 LOOP
350 LET A(I+1)=SW
360 NEXT
370 END DEF</lang>
=={{header|C}}==
| |||