Create a gist now

Instantly share code, notes, and snippets.

refactoring
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
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment