ruby_algorithms 0.0.1.pre

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 103e2764b69931bb01a62ccef977c353297cc1ce
+  data.tar.gz: cea9d0bc0e02ccd64de84980a12de3c7a5e2c2d5
+SHA512:
+  metadata.gz: 1ad315eeb0965fcbcdc09a1a2720700e2858d9b966f2a3a6338c971b6d9ffae306786351bfedd2e3fa4edb996572bc1907fa0126d9e9f578ad133d50773996ea
+  data.tar.gz: 1991bf53b5967587292f27d6f0272322cc7fb9d25d29ff05d17c5a4ef39e6f102d1a069efa1d39a0546777e95ae81d0b47a242c29a29a36d1cfad7362255bc21

data/.byebug_history

@@ -0,0 +1,256 @@
+quit
+c
+array[i]
+c
+counting_array
+k
+array[i]
+c
+counting_array
+array[i]
+c
+array[i]
+c
+counting_array
+array
+array[i]
+c
+array[i]
+counting_array
+c
+array[i]
+counting_array
+c
+array[i]
+counting_array
+c
+array[i]
+counting_array
+c
+array[i]
+c
+b 89
+counting_array
+c
+b 88
+k
+quit
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+array
+c
+largest
+c
+largest
+array
+c
+largest
+c
+comparison
+array
+arrat
+array[left]
+array[left].send(comparison, array[i])
+array[left].send(comparison, array[i]
+largest
+i
+array
+c
+right
+left
+array[left]
+array[left].send(comparison, array[i])
+array[left].send(comparison, array[i]
+array
+c
+largest
+c
+array
+array[right]
+array[right].send(comparison, array[largest])
+array[right].send(comparison, array[largest]
+array[left]
+array[left].send(comparison, array[i])
+array[i]
+largest
+left
+i
+array
+c
+largest
+c
+b 109
+is_desc? ? :< : :>
+is_desc?
+is_desc
+comparison
+array[i]
+array[left].send(comparison, array[i])
+array[left]
+3 * 2 + 2
+3 * 2 + 1
+3 * 2 
+8 / 2 - 1
+8 / 2 
+4 * 2 + 1
+4 * 2 
+2 * 2 + 1
+array[2]
+array.length/2 - 1
+array.length/2
+array.length
+array
+largest
+quit
+array
+heapify array, 0, array.length
+array[0] = 6
+array
+heapify array, 0, array.length
+array
+quit
+test + array[0..2]
+test = [1, 2, 3]
+test
+test.push(*array[1..2])  
+test.concat array[0..2]
+test + array[0..2]
+test << array[0..2]
+test = []
+test << array[0..2]
+array[0..2]
+left_array
+array
+j
+left_array
+c
+i
+left_array
+r
+p
+c
+right_array
+k
+r
+p
+c
+left_array
+r
+p
+k
+quit
+r
+array2[j]
+array1[i]
+array[i]
+k
+r
+p
+c
+b 52
+array2
+c
+array2
+array1
+array[1]
+q + j
+j
+r
+n2
+array
+array1
+array2
+b 52
+array1
+left_array
+b 50
+p..r
+j
+q + j
+j
+left_array
+c
+b 46
+p
+i
+c
+b 42
+n2
+n1
+r
+q
+p 
+n1
+quit
+1..s
+s = 5
+n2 = r - m
+n
+n = m - p + 1
+n = q - p + 1
+r
+p
+m
+quit
+r
+q
+p
+array
+c
+r
+p
+c
+r
+p
+c
+r
+p
+c
+array
+r
+p
+c
+r
+p
+quit
+r
+p
+c
+r
+p
+c
+q
+c
+b 29
+quit
+r
+p
+c
+r
+p

data/.gitignore

@@ -0,0 +1,11 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*/.idea/
+.idea/workspace.xml

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,13 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, we pledge to respect all people who contribute through reporting issues, posting feature requests, updating documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free experience for everyone, regardless of level of experience, gender, gender identity and expression, sexual orientation, disability, personal appearance, body size, race, ethnicity, age, or religion.
+
+Examples of unacceptable behavior by participants include the use of sexual language or imagery, derogatory comments or personal attacks, trolling, public or private harassment, insults, or other unprofessional conduct.
+
+Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct. Project maintainers who do not follow the Code of Conduct may be removed from the project team.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by opening an issue or contacting one or more of the project maintainers.
+
+This Code of Conduct is adapted from the [Contributor Covenant](http://contributor-covenant.org), version 1.0.0, available at [http://contributor-covenant.org/version/1/0/0/](http://contributor-covenant.org/version/1/0/0/)

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in algorithms.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 uchennafokoye
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,41 @@
+# Ruby Algorithms
+
+This is currently in development. Feel free to send your feedback or comments to uchennafokoye@gmail.com.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'ruby_algorithms'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install ruby_algorithms
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/lorem. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,12 @@
+require "bundler/gem_tasks"
+require 'rake/testtask'
+
+
+Rake::TestTask.new do |t|
+      t.libs << "test"
+      t.libs << "test/sort_tests"
+      t.libs << "lib"
+      t.libs << "lib/ruby_algorithms/sort"
+      t.test_files = FileList['test/**/*_test.rb']
+      t.verbose = true
+end

data/algorithms/.idea/data_structures_and_algorithms.iml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="RUBY_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "ruby_algorithms"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start

data/bin/setup

@@ -0,0 +1,7 @@
+#!/bin/bash
+set -euo pipefail
+IFS=$'\n\t'
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/exe/algorithms

@@ -0,0 +1,3 @@
+#!/usr/bin/env ruby
+
+require 'ruby_algorithms'

data/lib/helpers/interface.rb

@@ -0,0 +1,7 @@
+module Interface
+  def method(name)
+    define_method(name) { |*args|
+      raise "interface method #{name} not implemented"
+    }
+  end
+end

data/lib/ruby_algorithms/sort/bubble_sort.rb

@@ -0,0 +1,87 @@
+require 'sorting_interface'
+class BubbleSort
+  # Important Characteristics
+  # 1. Compares all the elements one by one and sort them based on their values
+  # 2. Called bubble sort because each iteration the smaller element in the list bubles up towards the first place,
+  # just like a water bubble rises up to the water surface
+  # 3. In Bubble Sort, n-1 comparisons done in 1st pass, n-2 in 2nd pass
+  # Complexity:
+  #     (n - 1) + (n - 2) + (n - 3) + ... 3 + 2 + 1
+  #     Sum  = n(n-1)/2
+  #     i.e O(n^2)
+  # 4. Best case: O(n) when list is already sorted
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = BubbleSort.order(array)
+  #     puts array # Output:  [1, 2, 3, 4, 5, 6]
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = BubbleSort.order(array, :desc => true)
+  #     puts array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  # OR
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     bubble = BubbleSort.new(array)
+  #     puts bubble.array # Output: [1, 2, 3, 4, 5, 6]
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     bubble = BubbleSort.new(array, :desc => true)
+  #     puts bubble.array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  #
+  # ### Get Time Complexity:
+  # Example:
+  #     best = BubbleSort::TIME_COMPLEXITY_BEST
+  #     worst = BubbleSort::TIME_COMPLEXITY_WORST
+  #     average = BubbleSort::TIME_COMPLEXITY_AVERAGE
+
+  include SortingInterface
+  TIME_COMPLEXITY_WORST = "O(n^2)"
+  TIME_COMPLEXITY_AVERAGE = "O(n^2)"
+  TIME_COMPLEXITY_BEST = "O(n)"
+  attr_reader :array, :desc
+
+  def initialize array, desc=false
+    unless array.is_a? Enumerable
+      raise "Please provide an array or other Enumerable"
+    end
+    unless (array.all? {|item| item.is_a? Comparable})
+      raise "All objects must implement Comparable"
+    end
+    @array = array
+    @desc = desc
+    self.sort
+  end
+
+  def self.order array, desc=false
+    instance = BubbleSort.new array, desc=desc
+    instance.array
+  end
+
+  protected
+  def sort
+    bubble_sort
+  end
+
+  def is_desc?
+    @desc
+  end
+
+  def bubble_sort
+    array = @array
+    for i in 1...array.length
+      (array.length-1).downto i do |j|
+        comparison = (is_desc?) ? array[j] > array[j-1] : array[j] < array[j-1]
+        if comparison
+          swap array, j, j-1
+        end
+      end
+
+    end
+  end
+
+end

data/lib/ruby_algorithms/sort/counting_sort.rb

@@ -0,0 +1,99 @@
+require 'sorting_interface'
+class CountingSort
+  # Important Characteristics
+  # 1. Must have values between (0, k) where k is larger than every value in the array
+  # 2. Counting sort is extremely fast -- Theta(k + n),  O(n) for worst case, best case and average
+  # 3. Uses spaces O(k + n)
+  # 4. Uses spaces O(k + n)
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = CountingSort.order(array)
+  #     puts array # Output:  [1, 2, 3, 4, 5, 6]
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = CountingSort.order(array, :desc => true)
+  #     puts array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  # OR
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     instance = CountingSort.new(array)
+  #     puts instance.array # Output: [1, 2, 3, 4, 5, 6]
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     instance = CountingSort.new(array, :desc => true)
+  #     puts instance.array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  #
+  # ### Get Time Complexity:
+  # Example:
+  #     best = CountingSort::TIME_COMPLEXITY_BEST
+  #     worst = CountingSort::TIME_COMPLEXITY_WORST
+  #     average = CountingSort::TIME_COMPLEXITY_AVERAGE
+
+  include SortingInterface
+
+  TIME_COMPLEXITY_WORST = "O(n)"
+  TIME_COMPLEXITY_AVERAGE = "O(n)"
+  TIME_COMPLEXITY_BEST = "O(n)"
+  SPACE_COMPLEXITY = "O(k+n)"
+
+  attr_reader :array, :desc, :k
+
+  # For more on k variable, read on counting sort
+  # k indicates that every number in the container is in the range (0, k)
+  def initialize array, k, desc=false
+    unless array.is_a? Enumerable
+      raise "Please provide an array or other Enumerable"
+    end
+    unless (array.all? {|item| item.is_a? Comparable})
+      raise "All objects must implement Comparable"
+    end
+    unless (array.all? {|item| item >= 0 && item < k})
+      raise "All items in array must be greater than or equal to 0 and less than k"
+    end
+    @array = array
+    @desc = desc
+    @k = k
+    self.sort
+  end
+
+  def self.order array, k, desc=false
+    instance = CountingSort.new array, k, desc=desc
+    instance.array
+  end
+
+  protected
+  def sort
+    n = array.length
+    counting_sort array, k
+  end
+
+  def is_desc?
+    @desc
+  end
+
+  def counting_sort array, k
+    n = array.length
+    counting_array = Array.new k, 0
+    for i in 0...n
+      counting_array[array[i]] += 1
+    end
+
+    idx = 0
+    comparison = is_desc? ? ((k-1).downto 0) : 0...k
+    for i in comparison
+      while counting_array[i] > 0
+        array[idx] = i
+        counting_array[i] -= 1
+        idx += 1
+      end
+    end
+
+
+  end
+
+
+end

data/lib/ruby_algorithms/sort/heap_sort.rb

@@ -0,0 +1,116 @@
+require 'sorting_interface'
+class HeapSort
+  # Important Characteristics
+  # 1. One of the best sorting methods being in-place and with no quadratic worst-case scenarios
+  # 2. Involves two basic parts:
+  #    - Creating a Heap of the unsorted list
+  #    - Then a sorted array is created by repeatedly removing the largest/smallest element
+  #      from the heap and inserting it into the array. The heap is reconstructed after each removal.
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = HeapSort.order(array)
+  #     puts array # Output:  [1, 2, 3, 4, 5, 6]
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = HeapSort.order(array, :desc => true)
+  #     puts array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  # OR
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     heap_sort = HeapSort.new(array)
+  #     puts heap.array # Output: [1, 2, 3, 4, 5, 6]
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     insertion = HeapSort.new(array, :desc => true)
+  #     puts insertion.array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  #
+  # ### Get Time Complexity:
+  # Example:
+  #     best = HeapSort::TIME_COMPLEXITY_BEST
+  #     worst = HeapSort::TIME_COMPLEXITY_WORST
+  #     average = HeapSort::TIME_COMPLEXITY_AVERAGE
+
+  include SortingInterface
+
+  TIME_COMPLEXITY_WORST = "O(n log n)"
+  TIME_COMPLEXITY_AVERAGE = "O(n log n)"
+  TIME_COMPLEXITY_BEST = "O(n log n)"
+  SPACE_COMPLEXITY = "O(n)"
+
+  attr_reader :array, :desc
+
+  def initialize array, desc=false
+    unless array.is_a? Enumerable
+      raise "Please provide an array or other Enumerable"
+    end
+    unless (array.all? {|item| item.is_a? Comparable})
+      raise "All objects must implement Comparable"
+    end
+    @array = array
+    @desc = desc
+    self.sort
+  end
+
+  def self.order array, desc=false
+    instance = HeapSort.new array, desc=desc
+    instance.array
+  end
+
+  protected
+  def sort
+    heap_sort array
+  end
+
+  def is_desc?
+    @desc
+  end
+
+  def comparison
+    # contrary to what may be expected:
+    # - create min-heap for descending sort i.e. 9 8 7 6 5 4
+    # - create max-heap for ascending sort i.e. 4 5 6 7 8 9
+    is_desc? ? :< : :>
+  end
+
+  def heap_sort array
+    build_heap(array)
+    n = array.length - 1
+    for heapsize in n.downto 1
+      swap array, 0, heapsize
+      heapify array, 0, heapsize
+    end
+
+  end
+
+  def build_heap array
+    n = array.length
+    half = (n/2).floor - 1
+    for i in half.downto 0
+      heapify array, i, n
+    end
+  end
+
+  def heapify array, i, heapsize
+    left = 2 * i + 1
+    right = 2 * i + 2
+
+    largest = i
+
+    if (left < heapsize && array[left].send(comparison, array[i]))
+      largest = left
+    end
+
+    if (right < heapsize && array[right].send(comparison, array[largest]))
+      largest = right
+    end
+    if largest != i
+      swap array, i, largest
+      heapify(array, largest, heapsize)
+    end
+  end
+
+end

data/lib/ruby_algorithms/sort/insertion_sort.rb

@@ -0,0 +1,92 @@
+class InsertionSort
+
+  # Important Characteristics
+  # 1. It has one of the simplest implementations
+  # 2. It is efficient for smaller data sets, but very inefficient for larger list
+  # 3. Insertion Sort is adaptive, that means it reduces its total number of steps if given a partially sorted list, hence it increases its efficiency
+  # 4. It is better than Selection Sort and Bubble Sort algorithms
+  # 5. Its space complexity is less; Like Buble Sort, insertion sort also requires a single additional memory space
+  # 6. It is Stable, as it does not change the relative order of elements with equal keys
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = InsertionSort.order(array)
+  #     puts array # Output:  [1, 2, 3, 4, 5, 6]
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = InsertionSort.order(array, :desc => true)
+  #     puts array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  # OR
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     insertion = InsertionSort.new(array)
+  #     puts insertion.array # Output: [1, 2, 3, 4, 5, 6]
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     insertion = InsertionSort.new(array, :desc => true)
+  #     puts insertion.array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  #
+  # ### Get Time Complexity:
+  # Example:
+  #     best = InsertionSort::TIME_COMPLEXITY_BEST
+  #     worst = InsertionSort::TIME_COMPLEXITY_WORST
+  #     average = InsertionSort::TIME_COMPLEXITY_AVERAGE
+
+
+  TIME_COMPLEXITY_WORST = "O(n^2)"
+  TIME_COMPLEXITY_AVERAGE = "O(n^2)"
+  TIME_COMPLEXITY_BEST = "O(n)"
+  attr_reader :array, :desc
+
+  def initialize array, desc=false
+    unless array.is_a? Enumerable
+      raise "Please provide an array or other Enumerable"
+    end
+    unless (array.all? {|item| item.is_a? Comparable})
+      raise "All objects must implement Comparable"
+    end
+    @array = array
+    @desc = desc
+    self.sort
+  end
+
+  def self.order array, desc=false
+    instance = InsertionSort.new array, desc=desc
+    instance.array
+  end
+
+  protected
+  def sort
+    insertion_sort
+  end
+
+  def is_desc?
+    @desc
+  end
+
+  # You carry a pointer. This pointer indicates last sorted point
+  # You iterate backwards comparing new pointer (i) to all other array points (j)
+  # If it is less than/greater than, then place it in its rightful position
+  # For descending order, just do the opposite.
+  def insertion_sort
+    array = @array
+    for i in 1...array.length
+      current_no = array[i]
+      j = i - 1
+      while j >= 0
+        comparison = is_desc? ? (current_no > array[j]) : (current_no < array[j])
+        unless comparison
+          break
+        end
+        array[j+1] = array[j]
+        j = j - 1
+      end
+      array[j+1] = current_no
+    end
+  end
+
+end

data/lib/ruby_algorithms/sort/merge_sort.rb

@@ -0,0 +1,122 @@
+class MergeSort
+
+  # Important Characteristics
+  # 1. It is quite fast and has a time complexity of O(n log n)
+  # 2. Time complexity of Merge Sort is O (n log n) in all 3 cases (worst, average and best)
+  # as merge sort always divides the array in two halves and takes linear time to merge two halves
+  # 3. It requires equal amount of additional space as the unsorted lsit. Hence its not at all recommended for search large unsorted lists
+  # 4. It is the best Sorting technique for sorting Linked lists
+  # 5. It follows the rule of Divide and Conquer
+  # 6. It is Stable, as it does not change the relative order of elements with equal keys
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = MergeSort.order(array)
+  #     puts array # Output:  [1, 2, 3, 4, 5, 6]
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = MergeSort.order(array, :desc => true)
+  #     puts array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  # OR
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     insertion = MergeSort.new(array)
+  #     puts insertion.array # Output: [1, 2, 3, 4, 5, 6]
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     insertion = MergeSort.new(array, :desc => true)
+  #     puts insertion.array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  #
+  # ### Get Time Complexity:
+  # Example:
+  #     best = MergeSort::TIME_COMPLEXITY_BEST
+  #     worst = MergeSort::TIME_COMPLEXITY_WORST
+  #     average = MergeSort::TIME_COMPLEXITY_AVERAGE
+  #     space = MergeSort::SPACE_COMPLEXITY
+
+  TIME_COMPLEXITY_WORST = "O(n log(n))"
+  TIME_COMPLEXITY_AVERAGE = "O(n log(n))"
+  TIME_COMPLEXITY_BEST = "O(n log(n))"
+  SPACE_COMPLEXITY = "O(n)"
+
+  attr_reader :array, :desc
+  def initialize array, desc=false
+    unless array.is_a? Enumerable
+      raise "Please provide an array or other Enumerable"
+    end
+    unless (array.all? {|item| item.is_a? Comparable})
+      raise "All objects must implement Comparable"
+    end
+    @array = array
+    @desc = desc
+    self.sort
+  end
+
+  def self.order array, desc=false
+    instance = MergeSort.new array, desc=desc
+    instance.array
+  end
+
+  protected
+  def sort
+    merge_sort @array, 0, array.length - 1
+  end
+
+  def merge_sort array, p, r
+    if p < r
+      q = ((p + r) / 2).floor
+      merge_sort(array, p, q)
+      merge_sort(array, q + 1, r)
+      merge(array, p, q, r)
+    end
+  end
+
+  def merge array, p, q, r
+    n1 = q - p + 1
+    n2 = r - q
+    left_array = []
+    right_array = []
+
+    for i in 1..n1
+      left_array[i] = array[p + i - 1]
+    end
+
+    for j in 1..n2
+      right_array[j] = array[q + j]
+    end
+
+    i = 1
+    j = 1
+    for k in p..r
+
+      if i >= left_array.length && (j < right_array.length)
+        array[k] = right_array[j]
+        j = j + 1
+        next
+      elsif j >= right_array.length && (i < left_array.length)
+        array[k] = left_array[i]
+        i = i + 1
+        next
+      elsif j >= right_array.length && i >= left_array.length
+        break
+      end
+
+      comparison = is_desc? ? (left_array[i] >= right_array[j]) : (left_array[i] <= right_array[j])
+      if comparison
+        array[k] = left_array[i]
+        i = i + 1
+      else
+        array[k] = right_array[j]
+        j = j + 1
+      end
+    end
+  end
+
+  def is_desc?
+    @desc
+  end
+
+end

data/lib/ruby_algorithms/sort/quick_sort.rb

@@ -0,0 +1,107 @@
+require 'sorting_interface'
+class QuickSort
+  # Important Characteristics
+  # 1. Worst case is O(n ^ 2) but typically runs O (n log n)
+  # 2. Not stable sort so it might change the occurence of two similar elements
+  # in the list while sorting
+  # 3. Can be very fast and requires very less additional space
+  # 4. The algorithm divides the list into three main parts:
+  #   - Elements less than the Pivot element
+  #   - Pivot element
+  #   - Elements greater than the pivot element
+  # 5. Techniques Used:
+  #    - Divide and conquer
+  #    - Recursion
+  #    - Array
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = QuickSort.order(array)
+  #     puts array # Output:  [1, 2, 3, 4, 5, 6]
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     array = QuickSort.order(array, :desc => true)
+  #     puts array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  # OR
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     instance = QuickSort.new(array)
+  #     puts instance.array # Output: [1, 2, 3, 4, 5, 6]
+  #
+  # Example:
+  #     array = [3, 2, 4, 5, 6, 1]
+  #     instance = QuickSort.new(array, :desc => true)
+  #     puts instance.array # Output: [6, 5, 4, 3, 2, 1]
+  #
+  #
+  # ### Get Time Complexity:
+  # Example:
+  #     best = QuickSort::TIME_COMPLEXITY_BEST
+  #     worst = QuickSort::TIME_COMPLEXITY_WORST
+  #     average = QuickSort::TIME_COMPLEXITY_AVERAGE
+
+  include SortingInterface
+
+  TIME_COMPLEXITY_WORST = "O(n^2)"
+  TIME_COMPLEXITY_AVERAGE = "O(n log n)"
+  TIME_COMPLEXITY_BEST = "O(n log n)"
+  SPACE_COMPLEXITY = "O(n log n)"
+
+  attr_reader :array, :desc
+
+  def initialize array, desc=false
+    unless array.is_a? Enumerable
+      raise "Please provide an array or other Enumerable"
+    end
+    unless (array.all? {|item| item.is_a? Comparable})
+      raise "All objects must implement Comparable"
+    end
+    @array = array
+    @desc = desc
+    self.sort
+  end
+
+  def self.order array, desc=false
+    instance = QuickSort.new array, desc=desc
+    instance.array
+  end
+
+  protected
+  def sort
+    n = array.length
+    quick_sort array, 0, n - 1
+  end
+
+  def is_desc?
+    @desc
+  end
+
+  def comparison_symbol
+    is_desc? ? :>= : :<=
+  end
+
+  def quick_sort array, left, right
+
+    if left < right
+      pi = partition array, left, right
+      quick_sort array, left, pi - 1
+      quick_sort array, pi + 1, right
+    end
+
+  end
+
+  def partition array, left, right
+    pivot = ((left + right) / 2).floor # could be randomly chosen but chose middle
+    swap array, pivot, right
+    store = left
+    for i in left..right-1
+      if array[i].send(comparison_symbol, array[right])
+        swap array, store, i
+        store = store + 1
+      end
+    end
+    swap array, store, right
+    return store
+  end
+end

data/lib/ruby_algorithms/sort/sortable.rb

@@ -0,0 +1,37 @@
+require 'insertion_sort'
+require 'merge_sort'
+require 'bubble_sort'
+class Sortable
+  attr_reader :array, :desc
+  def initialize array, desc=false
+    unless array.is_a? Enumerable
+      raise "Please provide an array or other Enumerable"
+    end
+    unless (array.all? {|item| item.is_a? Comparable})
+      raise "All objects must implement Comparable"
+    end
+    @array = array
+    @desc = desc
+  end
+
+  def insertion_sort!
+    @array = InsertionSort.order(@array, desc=@desc)
+  end
+
+  def merge_sort!
+    @array = MergeSort.order(@array, desc= @desc)
+  end
+
+  def equal? sortable
+    unless sortable.is_a? Sortable
+      return false
+    end
+    self.array == sortable.array
+  end
+
+  protected
+  def is_desc?
+    @desc
+  end
+
+end

data/lib/ruby_algorithms/sort/sorting_interface.rb

@@ -0,0 +1,5 @@
+module SortingInterface
+  def swap array, i, j
+    array[i], array[j] = array[j], array[i]
+  end
+end

data/lib/ruby_algorithms/sort.rb

@@ -0,0 +1,6 @@
+require 'helpers/interface'
+require 'ruby_algorithms/sort/sortable'
+class Sort
+  def initialize
+  end
+end

data/lib/ruby_algorithms/version.rb

@@ -0,0 +1,11 @@
+module RubyAlgorithms
+  VERSION = "0.0.1.pre"
+  NAME = "ruby_algorithms"
+  SUMMARY = 'This gem includes the common data structures and algorithms.'
+  DESCRIPTION = 'This gem includes the common data structures and algorithms.'
+  AUTHORS = ['Uchenna F. Okoye']
+  DATE = '2016-03-30'
+  LICENSE = 'MIT'
+  HOMEPAGE = 'https://github.com/ruby-math/RubyAlgorithms'
+  EMAIL = 'uchennafokoye@gmail.com'
+end

data/lib/ruby_algorithms.rb

@@ -0,0 +1,4 @@
+module RubyAlgorithms
+end
+require 'ruby_algorithms/sort'
+

data/ruby_algorithms.gemspec

@@ -0,0 +1,38 @@
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'ruby_algorithms/version'
+
+Gem::Specification.new do |s|
+  s.name = RubyAlgorithms::NAME
+  s.version = RubyAlgorithms::VERSION
+  s.date = RubyAlgorithms::DATE
+  s.summary = RubyAlgorithms::SUMMARY
+  s.description = RubyAlgorithms::DESCRIPTION
+  s.authors = RubyAlgorithms::AUTHORS
+  s.email = RubyAlgorithms::EMAIL
+  s.homepage = RubyAlgorithms::HOMEPAGE
+  s.license = RubyAlgorithms::LICENSE
+  # Prevent pushing this gem to RubyGems.org by setting 'allowed_push_host', or
+  # delete this section to allow pushing this gem to any host.
+  if s.respond_to?(:metadata)
+    s.metadata['allowed_push_host'] = 'https://rubygems.org'
+  else
+    raise "RubyGems 2.0 or newer is required to protect against public gem pushes."
+  end
+  s.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|s|features)/}) }
+  s.bindir        = "exe"
+  s.executables   = s.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  s.require_paths = ["lib", "lib/ruby_algorithms", "lib/ruby_algorithms/sort"]
+
+  s.add_development_dependency "bundler", "~> 1.10"
+  s.add_development_dependency "rake", "~> 10.0"
+  s.add_development_dependency "rdoc"
+  s.add_development_dependency "minitest"
+  s.add_development_dependency "minitest-reporters"
+  s.add_development_dependency "simplecov"
+  s.add_development_dependency "byebug"
+  s.add_development_dependency "pry"
+  s.add_development_dependency "pry-rescue"
+
+
+end

metadata

@@ -0,0 +1,197 @@
+--- !ruby/object:Gem::Specification
+name: ruby_algorithms
+version: !ruby/object:Gem::Version
+  version: 0.0.1.pre
+platform: ruby
+authors:
+- Uchenna F. Okoye
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-03-30 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rdoc
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: minitest-reporters
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: byebug
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pry-rescue
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: This gem includes the common data structures and algorithms.
+email: uchennafokoye@gmail.com
+executables:
+- algorithms
+extensions: []
+extra_rdoc_files: []
+files:
+- ".byebug_history"
+- ".gitignore"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- algorithms/.idea/data_structures_and_algorithms.iml
+- bin/console
+- bin/setup
+- exe/algorithms
+- lib/helpers/interface.rb
+- lib/ruby_algorithms.rb
+- lib/ruby_algorithms/sort.rb
+- lib/ruby_algorithms/sort/bubble_sort.rb
+- lib/ruby_algorithms/sort/counting_sort.rb
+- lib/ruby_algorithms/sort/heap_sort.rb
+- lib/ruby_algorithms/sort/insertion_sort.rb
+- lib/ruby_algorithms/sort/merge_sort.rb
+- lib/ruby_algorithms/sort/quick_sort.rb
+- lib/ruby_algorithms/sort/sortable.rb
+- lib/ruby_algorithms/sort/sorting_interface.rb
+- lib/ruby_algorithms/version.rb
+- ruby_algorithms.gemspec
+homepage: https://github.com/ruby-math/RubyAlgorithms
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+- lib/ruby_algorithms
+- lib/ruby_algorithms/sort
+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: 1.3.1
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.5.1
+signing_key: 
+specification_version: 4
+summary: This gem includes the common data structures and algorithms.
+test_files: []