Sorting algorithms/Bubble sort: Difference between revisions

Content added Content deleted
Line 1,402: Line 1,402:


==={{header|FTCBASIC}}===
==={{header|FTCBASIC}}===
<syntaxhighlight lang="basic">use time.inc
<syntaxhighlight lang="basic">rem bubble sort benchmark example
rem compile with FTCBASIC

use time.inc
use random.inc
use random.inc


define sorting = 0, index = 0, size = 0
define const size = 32000

⚫
dim list[size]

define sorting = 0, index = 0, elements = 0
define timestamp = 0, sorttime = 0
define timestamp = 0, sorttime = 0
define temp1 = 0, temp2 = 0
define temp1 = 0, temp2 = 0

⚫
dim list[32000]


cls
cls


print "Bubble sort benchmark test"
print "Bubble sort benchmark test"
⚫
print "How many elements to generate and sort (max 32000)? " \


do
input size

⚫
print "How many elements to generate and sort (max " \
print size \
print ")? " \

input elements

loop elements > size


gosub fill
gosub fill
Line 1,447: Line 1,459:
+1 index
+1 index


loop index < size
loop index < elements


return
return
Line 1,481: Line 1,493:
+1 index
+1 index


loop index < size - 1
loop index < elements - 1


loop sorting = 1
loop sorting = 1
Line 1,502: Line 1,514:
+1 index
+1 index


loop index < size
loop index < elements


return</syntaxhighlight>
return</syntaxhighlight>
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Bubble_sort"