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
def is_prime_number(item) | |
return false if item == 1 | |
return is_prime_number(item) if item % number != 0 | |
end |
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
def is_prime_number(item) | |
return is_prime_number(item) if item % number != 0 | |
end |
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
def is_prime_number(item) | |
return is_prime_number(item) | |
end |
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
def is_prime_number(item) | |
return false if item == 1 | |
(2..(item - 1)).each do |number| | |
if item % number == 0 | |
return false | |
end | |
end | |
return true | |
end |
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
def count_prime_number_version_2(array) | |
array.count do |item| | |
is_prime_number(item) | |
end | |
end | |
def is_prime_number(item) | |
return false if item == 1 | |
(2..(item - 1)).each do |number| |
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
def count_prime_final_version(array) | |
array.count do |item| | |
Prime.prime?(item) | |
end | |
end | |
array = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] | |
puts count_prime_final_version(array) |
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
def count_prime_version_6(array) | |
array.count do |item| | |
Prime.prime?(item) | |
end | |
end |
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' | |
Prime.prime?(item) |
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
def is_prime_number(item) | |
return false if item == 1 | |
(2..(item - 1)).each do |number| | |
if item % number == 0 | |
return false | |
end | |
end | |
return true | |
end |
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
def count_prime_number_version_2(array) | |
array.count do |item| | |
is_prime_number(item) | |
end | |
end |