Now that we've solved the split-in-half problem, the remaining challenge is to merge two sorted lists into a single in-order list (Snap! starter file MergeSort
):
☞ Finish this definition by filling the
else
slot.☞ Do you have to check for the two first items being equal? Why or why not?
And here's the sort
block that uses these pieces:
The block that actually does the work of putting the items in order is
Choose one: