compare-sort 0.0.0 → 0.1.0

checksums.yaml

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

data/lib/compare-sort.rb

@@ -27,12 +27,13 @@ class CompareSort
 		data = info[:data]
 		view = info[:view]
 
-		sorting_methods = %w(SelectionSort BubbleSort ModifiedBubbleSort InsertionSort)
+		sorting_methods = %w(QuickSort SelectionSort BubbleSort ModifiedBubbleSort InsertionSort MergeSort)
 		sorting_times = {}
+		info_hash = { data: data.dup, timer: true }
 
 		sorting_methods.each do |method|
-			info = { data: data, sorting_method: method, timer: true }
-			sorting_times[method] = self.run(info)
+			info_hash = { data: data.dup, sorting_method: method, timer: true }
+			sorting_times[method] = self.run(info_hash)
 		end 
 
 		if view
@@ -178,5 +179,87 @@ class BubbleSort
 	end
 end 
 
+class MergeSort 
+	def self.run(nums)
+		return nums if nums == []
+		#split into single arrays 
+		nums.map! {|num| [num]}
+
+		#run until sorted
+		while nums.length != 1
+			i = 0
+			#iterate through the nested array and merge them
+			while i < nums.length
+				merged_nums = self.merge(nums[i], nums[i+1])
+				nums.delete_at(i+1)
+				nums.delete_at(i)
+				nums.insert(i, merged_nums)
+				i += 1
+			end 
+		end
+		return nums[0]
+	end
+
+	def self.merge(nums1, nums2)
+		# this will happen if there are an off number of arrays
+		return nums1 if !nums2
+
+		total_length = nums1.length + nums2.length
+		sorted_nums = []
+
+		until sorted_nums.length == total_length
+			if nums2.empty?
+				sorted_nums += nums1
+			elsif nums1.empty?
+				sorted_nums += nums2
+			elsif nums2[0] < nums1[0]
+				sorted_nums << nums2.shift
+			else 
+				sorted_nums << nums1.shift
+			end 
+		end
+		return sorted_nums
+	end 
+end 
+
+
+class QuickSort 
+	def self.run(data)
+		return data if data.length <= 1
+
+		return self.sort_section(data, 0, data.length-1)
+	end 
+
+	def self.sort_section(data, start_loc, end_loc)
+		return data if end_loc - start_loc <1
+		wall = start_loc
+		pivot = data[end_loc]
+
+
+		for i in start_loc..end_loc #valid indicies
+			if data[i]<pivot
+				smaller_datum = data[i]
+				data.delete_at(i)
+				data.insert(wall, smaller_datum)
+				wall += 1
+			end 
+		end 
+			data.insert(wall, pivot)
+			data.delete_at(end_loc + 1)
+
+		self.sort_section(data, start_loc, wall-1)
+		self.sort_section(data, wall+1, end_loc)
+	end 
+end 
+
+
+
+
+
+
+
+
+
+
 
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: compare-sort
 version: !ruby/object:Gem::Version
-  version: 0.0.0
+  version: 0.1.0
 platform: ruby
 authors:
 - Amelia Downs