why is my brute force(O((n1+n2)log(n1+n2))) solution faster than the optimised solution(O(n1+n2))?

Question

I was working on merging 2 sorted array of lengths n1 and n2 to return a sorted array of length n1+n2. My brute force solution is supposed to have Time complexity of O((n1+n