Program a method merge_sorted(a,b) that when given two sorted arrays a and b, returns a new sorted array c that has the elements from array a and array b. For example when given a = [1,3,5,6,10] b = [1,4,6,8] the resulting array should be: c = [1,1,3,4,5,6,6,8,10] This method should not call a sorting method. Instead, the resulting array should be produced by "zipping" the two input arrays together: we repeatedly select the least element that we did not consider before from a and b and include this in c. For example: a = [1,3,5,6,10] ^ b = [1,4,6,8] ^ c = [1,1,3,...] the arrows (^) point to the lowest element we did not consider before. Of these, element 4 from b is less than element 5 from a. For this reason, we select 4 as the next element and advance the arrow ^ for b to point to 6. I start the function with def merge_sorted(a,b):
Program a method merge_sorted(a,b) that when given two sorted arrays a and b, returns a new sorted array c that has the elements from array a and array b. For example when given
a = [1,3,5,6,10]
b = [1,4,6,8]
the resulting array should be:
c = [1,1,3,4,5,6,6,8,10]
This method should not call a sorting method. Instead, the resulting array should be produced by "zipping" the two input arrays together: we repeatedly select the least element that we did not consider before from a and b and include this in c.
For example:
a = [1,3,5,6,10]
^
b = [1,4,6,8]
^
c = [1,1,3,...]
the arrows (^) point to the lowest element we did not consider before. Of these, element 4 from b is less than element 5 from a. For this reason, we select 4 as the next element and advance the arrow ^ for b to point to 6.
I start the function with
Step by step
Solved in 2 steps with 1 images
