Loading Makefile +5 −3 Original line number Diff line number Diff line Loading @@ -14,3 +14,5 @@ test: @ time -f "%C : %E seconds" ./prime.py 100000 > /dev/null @ time -f "%C : %E seconds" ./prime.lua 100000 > /dev/null @ time -f "%C : %E seconds" ./prime.php 100000 > /dev/null @ time -f "%C : %E seconds" ./prime.rb 100000 > /dev/null @ time -f "%C : %E seconds" ./prime.js 100000 > /dev/null prime.js 0 → 100755 +22 −0 Original line number Diff line number Diff line #!/usr/bin/env node --use_strict function isPrime(num) { let num_sqr = Math.sqrt(num) if(num_sqr % 1 == 0) return false for(let i=2; i<num_sqr; i++) if(num % i == 0) return false return true } var primes = [] let i = 2 while(primes.length < parseInt(process.argv[2])) { if(isPrime(i)) primes.push(i) i++ } console.log(primes) prime.rb 0 → 100755 +23 −0 Original line number Diff line number Diff line #!/usr/bin/env ruby def isPrime(num) num_sqr = Math.sqrt(num) return false if num_sqr % 1 == 0 (2..num_sqr.to_i).each do |n| return false if num % n == 0 end return true end primes = [] i = 2 while primes.count < ARGV.first.to_i do primes << i if isPrime(i) i += 1 end puts primes Loading
Makefile +5 −3 Original line number Diff line number Diff line Loading @@ -14,3 +14,5 @@ test: @ time -f "%C : %E seconds" ./prime.py 100000 > /dev/null @ time -f "%C : %E seconds" ./prime.lua 100000 > /dev/null @ time -f "%C : %E seconds" ./prime.php 100000 > /dev/null @ time -f "%C : %E seconds" ./prime.rb 100000 > /dev/null @ time -f "%C : %E seconds" ./prime.js 100000 > /dev/null
prime.js 0 → 100755 +22 −0 Original line number Diff line number Diff line #!/usr/bin/env node --use_strict function isPrime(num) { let num_sqr = Math.sqrt(num) if(num_sqr % 1 == 0) return false for(let i=2; i<num_sqr; i++) if(num % i == 0) return false return true } var primes = [] let i = 2 while(primes.length < parseInt(process.argv[2])) { if(isPrime(i)) primes.push(i) i++ } console.log(primes)
prime.rb 0 → 100755 +23 −0 Original line number Diff line number Diff line #!/usr/bin/env ruby def isPrime(num) num_sqr = Math.sqrt(num) return false if num_sqr % 1 == 0 (2..num_sqr.to_i).each do |n| return false if num % n == 0 end return true end primes = [] i = 2 while primes.count < ARGV.first.to_i do primes << i if isPrime(i) i += 1 end puts primes