input: word = "Hi Bob good to see you"
output: word = "HiBobgoodtoseeyou"
Write a short test plan for computeParity. Group your tests according to the kind of situation that they address.
For now, let's assume that someone else has written the merge procedure for us and that its specification is:
middle is the index of the last integer in the left sub-array, and middle + 1 is the first integer in the right sub-array.
Write a recursive function named merge_sort that satisfies the following specification:
As with QuickSort, the base case in MergeSort will be an array of
size 0 or 1, that is,
when first >= last.