greedy algorithm v3 (big amount of coins)

gistfile1.txt

def make_change(number, *coin_values)
  coin_values.empty? ? cents = [50, 20, 10, 5, 2, 1] : cents = coin_values.flatten.sort!.reverse
  rest = []
  while number > 0
    el = cents.select {|x| (number % x) == 0}
    number.div(el.first.to_i).times { rest << el.first }
    number -= el.first.to_i * number.div(el.first.to_i)
    cents.pop(el.first)
  end
  print rest.flatten
end

make_change 14, [10, 7, 1]