Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted
No edit summary
Line 354: Line 354:
=={{header|Commodore BASIC}}==
=={{header|Commodore BASIC}}==
<lang basic>
<lang basic>
10 dima(10):n=9
10 DIM A(10): N=9
11 REM GENERATE SOME RANDOM NUMBERS AND PRINT THEM
11 rem generate some random numbers and print them
12 fori=0ton:a(i)=int(rnd(1)*10)+1:next:gosub50
12 FOR I=0 TO N: A(I)=INT(RND(1)*10)+1: NEXT: GOSUB 50
20 forj=1ton:key=a(j):i=j-1:gosub30:a(i+1)=key:next:gosub50:end
20 FOR J=1 TO N:KEY=A(J): I=J-1: GOSUB 30: A(I+1)=KEY: NEXT: GOSUB 50: END
30 ifi=-1 then return
30 IFI=-1 THEN RETURN
31 ifa(i)>key then a(i+1)=a(i):i=i-1:goto30
31 IFA(I)>KEY THEN A(I+1)=A(I):I=I-1: GOTO 30
32 return
32 RETURN
50 print:fori=0ton:printa(i):next:return
50 PRINT: FOR I=0 TO N: PRINTA(I): NEXT: RETURN
</lang>
</lang>


Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort"