Binary Heaps in the Context of Prioritization #1

sorted_array.rb

def sorted_array_shifter(length, n)
  random_array = (1..length).to_a.inject(Array.new) do |arr, el| 
    el = rand(1..el); arr << el;
  end
  array = random_array.sort {|x,y| y<=>x }
  n.times do
    array.shift
  end
end