#codingexercise

Merge two sorted lists: 

List<int> merge(List<int> A, List<int> B) 

{ 

List<int> result = new ArrayList<int>(); 

While (A != null && B != null && A.size() > 0 && B.size() > 0) 

{ 

 int min = A.get(0) <= B.get(0) ? A.remove(0) : B.remove(0); 

 result.add(min); 

} 

While (A != null && A.size() > 0) 

{ 

result.add(A.remove(0)); 

} 

While(B != null && B.size() > 0) 

{ 

result.add(B.remove(0)); 

} 

return result; 

} 

 

Test cases: 

1. Null, Null -> [] 

2. Null, [] -> [] 

3. [], Null -> [] 

4. [],[] -> [] 

5. [1],[] -> [1] 

6. [], [1] -> [1] 

7. [1],[1] -> [1, 1] 

8. [1],[2] -> [1, 2] 

9. [2],[1] -> [1,2] 

10. [1],[2,3] -> [1,2,3] 

11. [1,2],[3] -> [1,2,3] 

12. [1,2,3],[] -> [1,2,3] 

13. [1,3][2] -> [1,2,3] 

14. [],[1,2,3] -> [1,2,3]