Given the following, what is the pseudocode for the merge function?
Given the following, what is the pseudocode for the merge function?
A = 1st sorted array.
B = 2nd sorted array.
C = Sorted output.
i = 1, position of 1st sorted array.
j = 1, position of 2nd sorted array.
for k = 1 to n
-if A[i] < B[j]
--C[k] = A[i]
--i++
-else (B[j] is < A[i])
--C[k] = B[j]
--j++
end