Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 16:23, 26 November 2016
, 7 years agoadded example for Commodore BASIC
(added example for Commodore BASIC) |
|||
Line 351:
-31 0 1 2 2 4 65 83 99 782
</pre>
==={{header|Commodore BASIC}}===
<lang basic>
10 dima(10):n=9
11 rem generate some random numbers and print them
12 fori=0ton:a(i)=int(rnd(1)*10)+1:next:gosub50
20 forj=1ton:key=a(j):i=j-1:gosub30:a(i+1)=key:next:gosub50:end
30 ifi=-1 then return
31 ifa(i)>key then a(i+1)=a(i):i=i-1:goto30
32 return
50 print:fori=0ton:printa(i):next:return
</lang>
=={{header|C}}==
| |||