冒泡法排序.bak

来自「常用算法」· BAK 代码 · 共 21 行

clear
dime a(10)
n=10
for i=1 to 10
   a(i)=int(rand()*100)
   ??a(i)
 next 
 for i=1 to n-1
    for j=n to i+1 step -1
      if a(j)>a(j-1)
       t=a(j)
       a(j)=a(j-1)
       a(j-1)=t
       endif
   next j
   next i
   ?"sort:"
   for i=1 to n
    ?? a(i)
   next i