prime-multiplication 1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 8cbfe899a7a56eaa27de0c65363e61fa282000ea
+  data.tar.gz: 523bab3021fbcd7b23ba204ad3299de6f9d12ce7
+SHA512:
+  metadata.gz: aabb6f6664bbbb85bf754bf6dfc46d46de32f51a412384db4bdee76782ba71e26ff177d9579639a14617e63525cbc88ba1e968501b9b1605efe68975138082e1
+  data.tar.gz: f52ff4fc07a1a717875c86fcfa1aff8553559a9a25d8243b4fe3d9359184461875204597cf770d6b5256277d3efe6b435e3227ddd66c08c870146bd88968f387

data/lib/PrimeMultiplication.rb

@@ -0,0 +1,150 @@
+# Time complexity for this program is O(n^2)
+class PrimeMultiplication
+	
+	# attribute accessors for:
+	# 				@@prime_array stores the first n prime numbers in an array
+	# 				@@no_of_primes stores the value of n for finding the first n prime numbers
+	# 				@@output_array stores the resulting multiplication matrix in a 2-Dimensional Array
+	# attr_accessor :@@output_array
+
+	# Get the program up and running by calling the functions in order
+	def self.run
+		get_user_input
+		get_primes
+    calculate_multiplication_table
+    print_prime_multiples
+	end
+
+	# Get the number of primes user wants
+	def self.get_user_input
+		input_right = false
+		@@no_of_primes = 0
+		loop do
+			print "Enter the number of primes you want: "
+			@@no_of_primes = gets.chomp.to_i
+			input_right = (@@no_of_primes.to_i > 0) ? true : false
+			if @@no_of_primes <= 0
+				print "\n Please enter a number( > 0 ) \n"
+				@@no_of_primes = 0
+			end
+			break if input_right
+		end
+    @@no_of_primes = @@no_of_primes
+	end
+
+	# Same as get_user_input but for TDD to check if the program takes any other input other than a positive number
+	def self.get_user_input_for_test
+		@@no_of_primes = 0
+		print "\n \t Enter value for the number of primes you want: "
+		@@no_of_primes = gets.chomp.to_i
+		if @@no_of_primes <= 0
+			print "Please enter a number( > 0 ): "
+			@@no_of_primes = 0
+			return
+		end
+		@@no_of_primes = @@no_of_primes
+	end
+
+	# Check if a number is prime
+	# Time complexity of this method is O(√n)
+	def self.is_prime?(number)
+		return false if number == 1
+		(2..(Math.sqrt(number).to_i)).each do |i|
+			if number % i == 0
+				return false
+			end
+		end
+		true
+	end
+
+	# Get first n prime numbers
+	# Time complexity for this method is O(n√n)
+  def self.get_primes
+  	@@prime_array = [""]
+		@@output_array = []
+    n = 2
+    loop do
+	    if is_prime?(n)
+    		@@prime_array << n
+    	end
+    	n = n + 1
+    	break if @@prime_array.length == @@no_of_primes+1
+   	end
+   	return @@prime_array
+  end
+
+  # calculate the Multiplication matrix for the prime numbers
+  # Time complexity for this method is O(n^2)
+  def self.calculate_multiplication_table
+  	@@prime_array.each_with_index do |element1, index1|
+  		@@output_array[index1] = []
+  		@@prime_array.each_with_index do |element2, index2|
+	  		if(index1 == 0 && index2 == 0)
+	  			@@output_array[index1][index2] = element1
+	  		elsif (index1 == 0)
+	  			@@output_array[index1][index2] = element2
+	  		elsif (index2 == 0)
+	  			@@output_array[index1][index2] = element1
+	  		else
+  				@@output_array[index1][index2] = element2*element1
+  			end
+  		end
+  	end
+  	return @@output_array
+  end
+
+  # print the Multiplication table on to the console
+  # Time complexity for this function is O(n^2)
+  def self.print_prime_multiples
+  	tabs = "\t" * (@@no_of_primes/2 - 3) rescue "\t"
+    print "\n #{tabs} Multiplication Table for first #{@@no_of_primes} Prime numbers \n\n"
+
+    @@prime_array.length.times do |i|
+  		print " _  _  _"
+  	end
+  	print "\n"
+
+  	@@prime_array.length.times do |i|
+  		if(i == 0)
+  			print "| \t"
+  		else
+  			print "| #{ordinal(i)} \t"
+  		end
+  	end
+  	print "|\n"
+  	
+  	@@prime_array.length.times do |i|
+  		print " _  _  _"
+  	end
+  	print "\n"
+  	
+  	@@output_array.each do |i|
+      print "\n"
+  		i.each do |j|
+  			print "| #{j} \t"
+  		end
+  		print "|\n"
+  		i.each do |j|
+  			print " _  _  _"
+  		end
+  		print "\n"
+  	end
+  	return
+  end
+
+  # helper method to give ordinal of a number eg. 1 should return 1st, 2 should return 2nd etc.
+  def self.ordinal(number)
+  	ending =
+      case number % 100
+        when 11, 12, 13 then 'th'
+        else
+          case number % 10
+            when 1 then 'st'
+            when 2 then 'nd'
+            when 3 then 'rd'
+            else 'th'
+            end
+        end
+		return number.to_s + ending
+  end
+end

metadata

@@ -0,0 +1,44 @@
+--- !ruby/object:Gem::Specification
+name: prime-multiplication
+version: !ruby/object:Gem::Version
+  version: '1.0'
+platform: ruby
+authors:
+- Kaushik Srivatsan
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2017-01-16 00:00:00.000000000 Z
+dependencies: []
+description: Program to print a table of prime multiples
+email: ksrivatsan89@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/PrimeMultiplication.rb
+homepage: http://rubygems.org/gems/prime-multiplication
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.8
+signing_key: 
+specification_version: 4
+summary: Prime Multiplication!
+test_files: []