Sorting algorithms/Bubble sort: Difference between revisions

(Sorting algorithms/Bubble sort in True BASIC)
Line 1,301:
dim list[size]
 
gosub fill
let index = 0
gosub sort
gosub show
do
 
end
let list[index] = int: (rnd) * 100
 
sub fill
let index = index + 1
 
loop for index <= 0 to size - 1
 
let list[index] = int: (rnd) * 100
do
print index
 
letnext index = 0
let sort = 0
 
return
let index = 0
 
sub sort
 
do
 
let temp1sort = index + 10
loop for index <= 0 to size - 12
 
let indextemp1 = index + 1
 
if list[index] > list[temp1] then
 
let temp2 = list[index]
let list[index] = list[temp1]
let list[temp1] = temp2
let sort = 1
 
endif
 
letnext index = index + 1
 
wait
loop index < size - 1
 
letloop sort = 01
wait
 
return
loop sort = 1
 
sub show
let index = 0
 
for index = 0 to size - 1
do
 
print index ," : ", list[index]
 
letnext index = index + 1
 
loop index < sizereturn</syntaxhighlight>
 
==={{header|FreeBASIC}}===
305

edits