Question: GIven two sets s1 and s2 and a number x, devise a divide and conquer algorithm for finding whether there exists a pair of elements,
GIven two sets s1 and s2 and a number x, devise a divide and conquer algorithm for finding whether there exists a pair of elements, one from s1 and another from s2 that adds up to x. Formulate a recurrence relation and solve by one method
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
