public
Created

refactoring

  • Download Gist
order.rb
Ruby
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47
def order(n)
i=1, a=1, list=[]
 
until (i==61 or a==n) do
if (a^i).modulo(n)==1
[a,i]>>list
a+=1
i=1
else
i+=1
end
end
 
return list
end
 
def order(n)
i = a = 1, list = []
 
until (i == 61 || a == n) do
if (a ^ i).modulo(n) == 1
list << [a,i]
a += 1
i = 1
else
i += 1
end
end
 
list
end
 
def order(n)
i = a = 1
 
[].tap do |list|
until (i == 61 || a == n) do
if (a ^ i).modulo(n) == 1
list << [a ,i]
a += 1
i = 1
else
i += 1
end
end
end
end

Please sign in to comment on this gist.

Something went wrong with that request. Please try again.