recursion using c

Given two arrays of integers output the smallest number in the
first array not present in the second one.

This sounds eerily familiar to a past hackerrank contest question.

Anyways, why dont you just sort both arrays, and then look up the minimum number by traversing the first array? Why complicate using recursion?