Question: Need help with assembly language homework 5.5.7: 10. Programming Exercise 5.5.7 gave an algorithm for merging two sorted integer arrays into a third sorted array.
10. Programming Exercise 5.5.7 gave an algorithm for merging two sorted integer arrays into a third sorted array. Write a procedure arrayMerge that implements that design in a procedure described by the fol- lowing C/C++ function header void arrayMerge (int arrayl [, int countl, int array2], int count2, int array3(1) // precondition: arrayl and array2 are sorted arrays with count1 and count2 elements, respectively Each has at least one unused slot. array3 has at least count1+count2 slots // postcondition: arrayl and array2 have been merged into the sorted array3 Parameters 1, 3, and 5 are the addresses of the three arrays
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
