def insert_into_sorted_helper(sorted, element, rest)
if rest.size == 0 then
sorted << element
elsif rest[0] >= element then
(sorted << element).concat(rest)
else
insert_into_sorted_helper(sorted << rest[0], element, rest[1..-1])
end
end
# Insert an element into a already sorted list. The resulting list stays sorted.
def insert_into_sorted(sorted, …