Ad
KSTNRvs.raulbc777

Fast Code to Find All Proper Factors Of a Number (ruby version)

Code
Diff
  • def divisors(n)
    fact = []
    for i in 1.. (Math.sqrt(n)).floor
        if n % i == 0 
            fact << i
            # more rubyish i think
            fact << (n / i) if (n / i) != i
        end
    end
    # no need for "return" in ruby
    fact.sort
end
    • def divisors(n)
    • fact = [];
    • fact = []
    • for i in 1.. (Math.sqrt(n)).floor
    • if n % i == 0
    • fact << i
    • if n / i != i
    • fact << n / i
    • end
    • # more rubyish i think
    • fact << (n / i) if (n / i) != i
    • end
    • end
    • fact.sort!
    • return fact
    • # no need for "return" in ruby
    • fact.sort
    • end