sorts_ESN 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: be422d225bad294568066ff75c41fee7ec58ce5c
+  data.tar.gz: 94478d84b0df77ea8dbedf6f939500c324ce954a
+SHA512:
+  metadata.gz: 4ff47f216adae873781dfce19bd908a6adf8485031b761a3708409c4d485e3053dddc56f6044d4aaa7ff87aa6c11f64aa3d28a03bdc78bd3ea82e772dc8c99f3
+  data.tar.gz: 2b968a9b23b9382dd24e10a21ac3fabf4f5cc45a4a75433aa8f4ec3c1f8085b60a41be73280561f5553aaa33f20cc8c6fd6f1387a385acba36cd88b919949413

data/lib/sorts_ESN.rb

@@ -0,0 +1,127 @@
+class Sorts_ESN
+
+	# insertion sort!
+	# ~ best O(n) 
+	# ~ average O(n^2)
+	# ~ worst O(n^2)
+	# stable sort
+	def self.insertion_sort (list)
+
+		# get to the sorting
+		list.each_with_index do |v,i|
+			
+			# value and current index
+			@val = v
+			@hole = i
+			
+			# iterate and swap as needed
+			while (@hole > 0 && @val < list[@hole -1])
+				list[@hole] = list[@hole -1]
+				@hole = @hole - 1
+			end
+			
+			# assign
+			list[@hole] = @val
+		end
+	end
+
+	# merge sort!
+	# ~ best O(n log n)
+	# ~ average O(n log n)
+	# ~ worst O(n log n) 
+	# stable sort
+	def self.merge_sort (list)
+		
+		# break case
+		return list if list.size <= 1
+		
+		# find middle of list
+		@mid = (list.size / 2).round
+		# take first half
+		@l = list.take(@mid)
+		# take second half
+		@r = list.drop(@mid)
+		
+		# recurse and join
+	    join(merge_sort(l), merge_sort(r))
+	end
+
+	# quick sort!
+	# ~ best O(n log n)
+	# ~ normal O(n log n) 
+	# ~ worst O(n^2)
+	# unstable sort
+	def self.quick_sort(list)
+		
+		# return empty array if list is empty
+		return [] if list.size == 0
+		
+		# create pointer to list
+		@x, *xs = *list
+		
+		# split list
+		@less, @more = xs.partition{|y| y < x}
+		
+		# recurse
+		quick_sort(@less) + [@x] + quick_sort(@more)
+	end
+
+	# bubble sort!
+	# ~ best O(n)
+	# ~ normal O(n^2) 
+	# ~ worst O(n^2)
+	# stable sort
+	def self.bubble_sort (list)
+		
+		# return if empty
+		return [] if list.size == 0
+
+		# sentinels (Ruby, y u no normal for loop?)
+		@i = 0
+		@j = 0
+		@len = list.size - 1 
+
+		# get to the swapping
+		while @i < @len do
+			# reset @j per loop
+			@j = 0 
+			while @j < (@len - @i) do	
+				# if it's bigger swap it out
+				swap(list, @j, @j + 1) if list[@j] > list[@j + 1]
+				# increment
+				@j = @j + 1	
+			end
+			# increment	
+			@i = @i + 1
+		end
+	end
+
+	# join!
+	# helper function!
+	def self.join (a, b) 
+
+		@joined = []
+		@a_i = 0
+		@b_i = 0
+
+		while (@a_i < a.length && @b_i < b.length)
+			if a[@a_i] < b[@b_i]
+				@joined.push(a[@a_i])
+				@a_i = @a_i + 1
+			else
+				joined.push(b[@b_i])
+				@b_i = @b_i + 1
+			end
+		end
+		# return
+		joined.concat(a.slice(@a_i, a.length)).concat(b.slice(@b_i, b.length)) 
+	end
+	# swap!
+	# helper function!
+	def self.swap (list, a, b)
+		@temp = list[a]
+		list[a] = list[b]
+		list[b] = @temp
+	end
+
+end

metadata

@@ -0,0 +1,44 @@
+--- !ruby/object:Gem::Specification
+name: sorts_ESN
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Ben Clark
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-10-07 00:00:00.000000000 Z
+dependencies: []
+description: A simple gem holding insertion, merge, bubble, and quick sort functions
+email: thecalestonrift@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/sorts_ESN.rb
+homepage: http://rubygems.org/gems/sorts-ESN
+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.0.6
+signing_key: 
+specification_version: 4
+summary: basic tester gem for common sorts
+test_files: []