diff --git a/CONTRIBUTORS.md b/CONTRIBUTORS.md
index 0b119e898..6b04065d8 100644
--- a/CONTRIBUTORS.md
+++ b/CONTRIBUTORS.md
@@ -48,3 +48,4 @@ Max Weinstein
 <br>
 Gibus Wearing Brony
 <br>
+Arun Sahadeo
diff --git a/contents/bubble_sort/bubble_sort.md b/contents/bubble_sort/bubble_sort.md
index 6b97a74bd..2a08b628c 100644
--- a/contents/bubble_sort/bubble_sort.md
+++ b/contents/bubble_sort/bubble_sort.md
@@ -38,6 +38,8 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 [import:1-13, lang:"swift"](code/swift/bubblesort.swift)
 {% sample lang="ti83b" %}
 [import:2-13, lang:"ti-83_basic"](code/ti83basic/BUBLSORT.txt)
+{% sample lang="ruby" %}
+[import:3-13, lang:"ruby"](code/ruby/bubble.rb)
 {% endmethod %}
 
 ... And that's it for the simplest bubble sort method.
@@ -81,6 +83,8 @@ Program.cs
 [import, lang:"swift"](code/swift/bubblesort.swift)
 {% sample lang="ti83b" %}
 [import, lang:"ti-83_basic"](code/ti83basic/BUBLSORT.txt)
+{% sample lang="ruby" %}
+[import, lang:ruby"](code/ruby/bubble.rb)
 {% endmethod %}
 
 <script>
diff --git a/contents/bubble_sort/code/ruby/bubble.rb b/contents/bubble_sort/code/ruby/bubble.rb
new file mode 100644
index 000000000..0511d06cc
--- /dev/null
+++ b/contents/bubble_sort/code/ruby/bubble.rb
@@ -0,0 +1,22 @@
+#!/usr/bin/env ruby
+
+def bubble_sort(arr)
+	(0..arr.length - 1).each do
+		(0..arr.length - 2).each do |k|
+			if arr[k] > arr[k + 1]
+				arr[k + 1], arr[k] = arr[k], arr[k + 1]
+			end
+		end
+	end
+
+	return arr
+end
+
+def main
+	range = [200, 79, 69, 45, 32, 5, 15, 88, 620, 125]	
+	puts "The range before sorting is #{range}"
+	range = bubble_sort(range)
+	puts "The range after sorting is #{range}"
+end
+
+main()