%program name: random number generator, no dupes
%programer: shpetim salihu

var rint : int := 0 % the randomly generated number
var r90 : array 1 .. 90 of int % the array where all the nubers go (the bingo list)
var yn : int := 0 % was the number a duplicate? yes/no
var sentinel : int := 0 %exit variable for the loop

for a : 1 .. 90 %sets the r90 variable to 0
r90 (a) := 0
end for

for g : 1 .. 90 % main for loop, runs 90 times, g = generate

sentinel := 0 %reset the sentinel value

loop %this loops until a random number that is not a duplicate is generated
exit when sentinel = 1%exit statement
yn := 0 %resets the "was it a dupe, yes/no" value
randint (rint, 1, 90)%generates a random number

for g2 : 1 .. g % loop to check if the number is duplicate
exit when yn = 1 %if it is dupe, it will exit

if rint = r90 (g2) then % is it a dupe?
yn := 1 %
else
yn := 0 %

end if
end for

if yn = 0 then %if its not a dupe, it wil add it to the array
r90 (g) := rint
sentinel := 1 %set the sentinel so that it exits
else
end if
end loop

put " ", r90 (g) .. %displays numbers for the user
end for

Clayton's implementation would be something like this:

Turing:

var nums : array 1 .. 90 of int var k : int for i: 1 .. 90    nums[i] := i end for for decreasing j: 90 .. 1    k := Rand.Int(1, j)  % get random element    put nums[k]  % result    nums[k] := nums[j]  % remove element end for

@zylum - it's not trivial to shuffle in Turing and will require an extra loop.