Challenging question! (Does anyone how to solve this Javabat question?)

Question

Does anyone how to solve this Javabat question?
Here is the link:
http://www.javabat.com/prob?id=Array3.linearIn

Answer 1

I'm a little surprised by the implied rating of this problem... it's a plain to-way merge. You can use the same template as for the merging step in merge sort:
public boolean linearIn(int[] outer, int[] inner) {
  int i = 0;
  int j = 0;
  while (i < outer.length || j < inner.length) {
      if (j < inner.length && (i == outer.length || inner[j] < outer)) {
// inner[j] smallest
return false;
else if (i < outer.length && (j == inner.length || outer[i] < inner[j])) {
// outer[i] smallest
i++;
else {
// inner[j] == outer[i]
i++; j++;
return true;