insertion_sort.rb

def print_arr(ar)
    ar.each do |i|
        printf("%d ", i)
    end
    puts
end

def insertionSort(a) 
    n = a.length - 1
    for i in (1..n) do

        value = a[i]
        h = i
        
        while h > 0 and a[h-1] > value do
            a[h] = a[h-1]
            h -= 1
        end
        a[h] = value
    end
    return a
end

ar = gets.strip.split.map {|i| i.to_i}

ar = insertionSort(ar, ar.length)
print_arr(ar)