sort.inc

1000 rem insertion sort (from Numerical Recipes)
1010 for j=2 to n
1020   a$=n$(j)
1021   t=c(j)
1030   for i=j-1 to 1 STEP -1
1040      if (n$(i)<=a$) then goto 1080
1050      n$(i+1)=n$(i)
1051      c(i+1)=c(i)
1060   next i
1070   i=0
1080   n$(i+1)=a$
1081   c(i+1)=t
1090 next j
1091 return
-end