Describe the problem: the two lists A and B respectively have m and n elements arranged in order. Mixing problem poses two lists A and B together into a list C is an unordered list.
Step 1: initialize three runs in the loop index i = 0, j = 0, k = 0 corresponds to the three arrays A, B and C.
Step 2: at each step if both indicators (i <m and j <n) we select min (A [i], B [j]) and save it in C [k]. Proceed to Step 4.
Step 3: increase value k 1 and return to step 2.
Step 4: Copy all of the remaining value from the list that indicators also violated (ie i <m or j <m) in the array C.
2. Source Code