INSERT SORT ALGORITHM

insert_sort.rb

#  INSERT SORT ALGORITHM
#  _____________________________________________________
#  $ ruby insert_sort.rb.rb 1 8 7 2 3 0 -1 8 3 7 6 -1
#  insert sort argorithm
#  original data: [1, 8, 7, 2, 3, 0, -1, 8, 3, 7, 6, -1]
#  sorted data: [-1, -1, 0, 1, 2, 3, 3, 6, 7, 7, 8, 8]

arr = ARGV.map(&:to_i)

puts <<DESC
  insert sort argorithm
  original data: #{arr}
DESC

for i in 2...arr.length
  v = arr[i]
  j = i - 1
  while j >= 0 && arr[j] > v
    arr[j + 1] = arr[j]
    j = j - 1
  end
  arr[j + 1] = v
end

puts <<DESC
  sorted data: #{arr}
DESC