Is there any other approach for this qn

#1

In question “MEDIAN OF SORTED ARRAYS” in stl challenges ,
i solved by simply sorting( AC) .Is there any other approach ?

#2

you can create two pointers: each one at the beginning of 0 index of ach array and maintain a counter equal to zero initially.
compare the data at both the indices and move the pointer with smaller data ahead by one and update counter by one. as soon as the counter becomes equal to n, compare elements at both the indices and return the smaller one. it is o(n) approach.