Algorithm for searching a value in two arrays
Hope that helps No, the algorithm is not very efficient. While you break as
soon as you find an a in A which is greater than k, you still have to test
all combinations of a and b before that, giving your algorithm a complexity
of O(m n), with n being
Date : January 12 2021, 08:33 AM , By : wesam hasabou