Arr = Array[4,10,6,8,7,1,9,0]

def insertsort()

  Arr.length.times{ |i|
  cur_elem = Arr[i]
  print Arr[i]
  print "\n" 
  sorted_arr_len = i 
  j = sorted_arr_len - 1
 while(j >= 0 and Arr[j] > cur_elem)             
   Arr[j+1] = Arr[j] 
   print("swapping #{Arr[j]} with #{cur_elem}\n")
  j = j - 1
 end
 Arr[j+1] = cur_elem
  }
 return Arr
end

print Arr.inspect 
print "\n"
A_sorted = insertsort()

print A_sorted.inspect
print "\n"