Simple Insertion Sort algorithm implemented with Ruby

insertion-sort.rb

#!/usr/bin/env ruby

num_arr = [31, 41, 59, 26, 41, 58]
puts "Original array:\n\t#{num_arr.join(",")}"

def insertion_sort(arr, comp)

  (1...arr.length).each do |j|
    key = arr[j]
    i = j - 1

    while i >= 0 && arr[i].method(comp).call(key)
      arr[i+1] = arr[i]
      i = i - 1
    end

    arr[i+1] = key
  end

  puts "Array after insertion sort:\n\t#{arr.join(",")}"
end

insertion_sort(num_arr, ">")

Insertion Sort Algorithm in Ruby from: https://atechdaily.com/posts/Insertion-Sort-Algorithm-in-Ruby