Created
April 20, 2017 22:36
-
-
Save JackHowa/2c3e1c5c8adbb6542b35d35e18cdc903 to your computer and use it in GitHub Desktop.
prime numbers refactor duke
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
require 'prime' | |
def prime_factors(number, output = []) | |
return [number] if number.prime? | |
# write def prime base case checker in method | |
# return output if number.prime? | |
factors = (2...number/2).to_a.select do |potential_factor| | |
number % potential_factor == 0 | |
end | |
output = prime_factors(number/factors[0],output) << factors[0] | |
end | |
def factors | |
p prime_factors(8) | |
p prime_factors(18) | |
# tag pull request of duke ruby racer |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment