insertion sorting in ruby at its finest, using traditional ruby methods and performing on a 256 digit array.

insertion sorting in ruby.rb

require_relative 'random_password'
include RandomPassword

class Array
  def insertion_sort
    start_time = Time.now
    arr = self
    for i in (1...(arr.size))
      if arr[i-1] > arr[i]
        i.downto(1) do |el|
          if arr[el] < arr[el-1]
            arr[el-1], arr[el] = arr[el], arr[el-1]
          end
        end
      end
    end
    puts "Insertion sorting took #{Time.now - start_time} ms for a 256 membered array"
    arr
  end
end

# just generates a random 256 digit password then split the string into an array of random characters to be sorted.
unsorted = generate.split('')
puts unsorted.inspect

sorted = unsorted.insertion_sort

puts sorted.inspect