This question can be solved by finding minimum of first array and maximum of another and printing pairwise.
But why is the converse not true ? Like finding the maximum of first array and minimum of another and then printing pairwise ? Kindly help me out here.
I have edited the question. Sorry for the inconvenience.
I have updated the question, thanks for replying though.
look this ->
But why is the converse not true ?
Why do you think that? It is completely true.
I got it, I think I messed up while printing them. Thanks.
i think o(n) is the solution to it not nlog(n)