compare-sort 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a213b50d3034c16f4f65ced7c6ed21bc620a5350
-  data.tar.gz: 0b587735f509d537dfcc2ec0f072ae1cd5a08bcf
+  metadata.gz: d99dd7e85db5eb562c91e9b7304598db32f5460f
+  data.tar.gz: f64cf9561dad9535f2e96d5548dd8d74f7324069
 SHA512:
-  metadata.gz: c0ef65116f1dd99ec09f83e7a22f22fe79e82fcdec3e2841dd7afa753ceb8363fe73ae31355a94e776ff0115ea2a10c11c1c167a94845b9ff8de3fc14b5a7abc
-  data.tar.gz: 6977984061569078024488bd6537880c3bf220b01d2a3cd59b5da83361669cab1d2932e2bb85c8b3e219bb015f3be66a44a94db6ee45805b98b3ca08200ec26a
+  metadata.gz: f0323d440e2ae1114d746bfa9a7934434bd53dddb240d8758bd11ca747668db44730ffce19cd5094a778fde8ab4442a2fc3a0dbad7597241bbf93306b4aa3579
+  data.tar.gz: 11c35e1f3564da55da5b8ba7708fd5cb5ab0853959169a3c723901e0091123f396e2589415d930696d16fc29ba5260b4ca1673008aa7a50764785ba7d408c289

data/lib/compare-sort.rb

@@ -27,7 +27,7 @@ class CompareSort
 		data = info[:data]
 		view = info[:view]
 
-		sorting_methods = %w(QuickSort SelectionSort BubbleSort ModifiedBubbleSort InsertionSort MergeSort)
+		sorting_methods = %w(HeapSort QuickSort SelectionSort BubbleSort ModifiedBubbleSort InsertionSort MergeSort)
 		sorting_times = {}
 		info_hash = { data: data.dup, timer: true }
 
@@ -252,7 +252,132 @@ class QuickSort
 	end 
 end 
 
+class HeapSort 
+	def self.run(data)
+		return data if data.length <= 1
+
+		# create heap 
+		heap = self.create_heap(data)
+
+		# then sort
+		sorted_data  = self.sort_heap(heap)
+
+		return sorted_data
+	end 
+
+	def self.create_heap(data)
+		for i in 0..(data.length-1)
+			# if they are greater than their parent swap them
+			current_index = i
+			current_value = data[i]
+			parent_index = get_parent(i)
+
+			while parent_index != nil && current_value > data[parent_index]
+				parent_value = data[parent_index]
+
+				# swap
+				data[parent_index] = current_value
+				data[current_index] = parent_value
+
+				#reset values
+				current_index = parent_index
+				parent_index = get_parent(current_index)
+				
+			end  
+		end 
+		return data
+	end
+
+	def self.get_parent(index)
+		parent_index = (index-1)/2
+		return nil if parent_index < 0 
+		return parent_index
+	end
+
+	def self.sort_heap(heap)
+		number_sorted = 0
+
+		while number_sorted < heap.length
+			# switch the root and the last element 
+			# puts "swapping root: #{heap[0]} with bottom: #{heap[-1-number_sorted]}"
+
+			heap[0], heap[-1-number_sorted] = heap[-1-number_sorted], heap[0]
+			# p heap
+
+			number_sorted += 1
+			current_index = 0
+			current_value = heap[0]
+
+			while !self.valid_parent(current_index, heap, number_sorted)
+
+				# find highest valid child index
+				max_child_i = self.find_larger_child(current_index, heap, number_sorted)
+		
+				# swap them 
+
+				heap[max_child_i], heap[current_index] = heap[current_index], heap[max_child_i]
+
+				# reset values
+				current_index = max_child_i
+
+			end 
+		end 
+		return heap
+
+	end 
+
+	def self.find_larger_child(parent_index, heap, number_sorted)
+		children_i = []
+
+		l_child_i = left_child_index(parent_index)
+		r_child_i = right_child_index(parent_index)
+
+		if l_child_i < (heap.length - number_sorted)
+			children_i << l_child_i
+		end 
+
+		if r_child_i < (heap.length - number_sorted)
+			children_i << r_child_i
+		end 
+
+		return nil if children_i.length == 0
+
+		max_child_i = children_i[0]
+
+		children_i.each do |index|
+			max_child_i = index if heap[index] > heap[max_child_i]
+		end 
+
+		return max_child_i
+
+	end   
 
+	def self.valid_parent(parent_index, heap, number_sorted)
+		parent_value = heap[parent_index]
+
+		valid = true 
+		l_child_i = left_child_index(parent_index)
+		r_child_i = right_child_index(parent_index)
+
+		if l_child_i < (heap.length - number_sorted) && heap[l_child_i] > heap[parent_index]
+			valid = false
+		end 
+
+		if r_child_i < (heap.length - number_sorted) && heap[r_child_i] > heap[parent_index]
+			valid = false 
+		end 
+
+		return valid
+	end 
+
+	def self.left_child_index(parent_index)
+		return 2*parent_index + 1
+	end 
+
+	def self.right_child_index(parent_index)
+		return 2*parent_index + 2
+	end 
+end 
 
 
 

metadata

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