Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given two sorted arrays of integers, a and b, and an integer c, I have to find i,j such that:
a[i] + b[j] <= c
and a[i] + b[j] is large as possible.
The best solution I can think of is in O(nlogn) time, taking every integer from first array and finding the lower bound of “c-a[i]“.
Can anyone suggest me a better way to do this (maybe in O(n) time)?
Thinking a bit about it, then you could ask yourself:
“Is it necessary, each time, to search in the sorted b-array for successive values from a[]?”