g
= INT(RND * 75 * 100) / 100 'reds will be tops for awhile loadSort g, greens()
r
= INT(RND * 100 * 100) / 100 loadSort r, reds()
gI = 1: rI = 1
gG = greens(gI): gR = reds(rI): row = 1: col = 40
row = row + 1: gI = gI + 1: gG = greens(gI)
row = row + 1: rI = rI + 1: gR = reds(rI)
SUB loadSort
(insertN
, dynArr
()) ' note this leaves dynArr(0) empty! so ubound of array is also number of items in list IF insertN
> dynArr
(j
) THEN ' GT to LT according to descending or ascending sort dynArr(k) = dynArr(k - 1)
dynArr(j) = insertN