Rosetta Code

Sorting algorithms/Insertion sort: Difference between revisions

Page Discussion

Sorting algorithms/Insertion sort (view source)

Revision as of 18:11, 31 October 2018

3 bytes removed ,  5 years ago
m
→‎{{header|IS-BASIC}}
No edit summary
Line 402:
 
==={{header|IS-BASIC}}===
<lang IS-BASIC> 100 PROGRAM "InserSrt.bas"
110 RANDOMIZE
120 NUMERIC ARRAY(5 TO 21)
120 LET N=20 ! Number of elements
130 NUMERICCALL INIT(ARRAY(1 TO N)
140 CALL INITWRITE(ARRAY)
150 CALL WRITEINSERTSORT(ARRAY)
160 CALL INSERTSORTWRITE(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 INSERTSORT(REF A)
290 DEF INSERTSORT FOR J=LBOUND(REFA)+1 TO UBOUND(A)
300 FOR J=2 TOLET NI=J-1:LET SW=A(J)
310 LETDO WHILE I>=J-1:LETLBOUND(A) AND SW=<A(JI)
320 DO WHILE I>0LET AND SW<A(I+1)=A(I):LET I=I-1
330 LET A(I+1)=A(I):LET I=I-1LOOP
340 LOOPLET A(I+1)=SW
350 LET A(I+1)=SWNEXT
360 END NEXTDEF</lang>
370 END DEF</lang>
 
=={{header|C}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/42976"