Merge Two Sorted Arrays
Two Pointers: i for array A, j for array B
β’ Compare A[i] and B[j], pick smaller
β’ Advance pointer of picked element
β’ Handle remaining elements when one array exhausted
Time: O(n + m)
O(n + m)