How can I write an algorithm to check if the sum of any two numbers in an array/list matches a given number
with a complexity of nlogn?
How can I write an algorithm to check if the sum of any two
Share
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.
How can I write an algorithm to check if the sum of any two numbers in an array/list matches a given number
with a complexity of nlogn?
I’m sure there’s a better way, but here’s an idea:
Both these operations are
O(n log n).