compare-sort 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: c91aefa1ba77dbbf0e014fbc3298eee1aa06d4c3
+  data.tar.gz: eb210a91422c7b200339347e0fc90f69b8ce4844
+SHA512:
+  metadata.gz: a4cb697367a54ab5f93d608a39ac13dd167bb809f5007a5e80f42b7294ccb235af527c3ba38121a5f68dc9003dbcfba7fda29c434748524d070eccd37a1da0e8
+  data.tar.gz: 2cd111d1c56dcd942081472f114461cd106fa1b77ef012719d645ae7f33baa0eb489ca7135115d45c251358ae8f406d55f969b75c20fd1d52e411c282b940c8b

data/lib/compare-sort.rb

@@ -0,0 +1,182 @@
+class CompareSort
+	def self.run(info)
+		data = info[:data]
+		sorting_method = info[:sorting_method]
+		timer = info[:timer]
+
+		ValidateData.run(data)
+
+		if timer 
+			sort = lambda { eval(sorting_method).run(data) }
+			return self.timer(sort)
+		else 
+			return eval(sorting_method).run(data)
+		end
+
+	end
+
+	def self.timer(sorting_method)
+		start_time = Time.now
+		sorted_list = sorting_method.call 
+		end_time = Time.now
+
+		return end_time - start_time
+	end 
+
+	def self.compare_all(info)
+		data = info[:data]
+		view = info[:view]
+
+		sorting_methods = %w(SelectionSort BubbleSort ModifiedBubbleSort InsertionSort)
+		sorting_times = {}
+
+		sorting_methods.each do |method|
+			info = { data: data, sorting_method: method, timer: true }
+			sorting_times[method] = self.run(info)
+		end 
+
+		if view
+			View.compare_all(sorting_times.sort_by{|method, time| time})
+		end
+
+		return sorting_times
+
+	end
+end
+
+class View 
+	def self.compare_all(data)
+		puts ""
+		print "SORTING METHOD"
+		print " "*(6)
+		puts "SECONDS"
+		puts "-"*27
+		data.each do |datum| 
+			print datum[0]
+			print " "*(20-datum[0].length)
+			puts datum[1]
+		end 
+		puts ""
+	end 
+end 
+
+class ValidateData
+
+	def self.run(data)
+		@data = data
+		self.isArray
+		self.valuesAreConsistent
+	end 
+
+	def self.isArray
+		raise "Data must be an array" if (!@data.is_a?(Array))
+	end 
+
+	def self.valuesAreConsistent
+		if @data[0].is_a?(String)
+			valuesAreStrings
+		else
+			valuesAreNumbers
+		end
+	end 
+
+	def self.valuesAreNumbers
+		@data.each do |datum|
+			if (!datum.is_a?(Fixnum) && !datum.is_a?(Float))
+				raise "Values in array must be all numbers OR all strings" 
+			end
+		end 
+	end
+
+	def self.valuesAreStrings
+		@data.each do |datum|
+			if (!datum.is_a?(String))
+				raise "Values in array must be all numbers OR all strings" 
+			end
+		end 
+	end
+end 
+
+
+class InsertionSort
+	def self.run(data)
+
+		# iterate through each element
+		data.each_with_index do |unsorted_num, i|
+			data[0..i].each_with_index do |sorted_num, j|
+
+				if sorted_num > unsorted_num
+					# insert to its new spot
+					data.insert(j, unsorted_num)
+					# delete it from old spot
+					data.delete_at(i+1)
+					break
+				end
+
+			end
+		end		
+		return data
+	end 
+end 
+
+
+class SelectionSort
+	def self.run(data)
+		len = data.length
+
+		# iterate through each element in the array
+		for i in 0..len-2
+			min_index = i
+			# iterate through the rest of the array
+			for j in i+1..len-1
+				# if min, save index
+				min_index = j if data[j] < data[min_index]
+			end
+			# put the min in it's correct spot
+			data[i], data[min_index] = data[min_index], data[i]
+		end
+
+		return data
+	end
+end 
+
+
+class ModifiedBubbleSort
+	def self.run(data)
+		sorted = false 
+
+		while !sorted 
+			sorted = true
+			# iterate through the whole array
+			(data.length - 1).times  do |i|
+				# if the element ahead of the one we are on is smaller 
+				# then switch them
+				if (data[i] > data[i+1])
+					data[i+1], data[i] = data[i], data[i+1]
+					sorted = false 
+				end
+			end 
+		end
+		return data
+	end
+end 
+
+class BubbleSort
+	def self.run(data)
+		sorted = false 
+		
+		(data.length).times  do |i|
+			(data.length - 1).times  do |j|
+
+				if (data[j] > data[j+1])
+					data[j+1], data[j] = data[j], data[j+1]
+				end
+			end 
+		end
+
+		return data
+	end
+end 
+
+
+

metadata

@@ -0,0 +1,44 @@
+--- !ruby/object:Gem::Specification
+name: compare-sort
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- Amelia Downs
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-08-14 00:00:00.000000000 Z
+dependencies: []
+description: A way to compare how long sorting algorithms take on data that you provide
+email: downs.amelia@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/compare-sort.rb
+homepage: 
+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.1
+signing_key: 
+specification_version: 4
+summary: Compare sorting algs
+test_files: []