This could be terribly trivial, but I\'m having trouble finding an answer that executes in less than n^2 time. Let\'s say I have two string arrays and I want to know which s
If one of the arrays is sorted you can do a binary search on it in the inner loop, this will decrease the time to O(n log n)
O(n log n)