Can you tell me the approach using divide and conquer
Can you tell me the approach using divide and conquer
@alter For divide and conquer, you just take every ith element and find its pair by searching for required_total - a[i].
For searching you can use binary search after sorting the array.
But it will be O(nlogn).
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.