Question: Given a sorted set (array) A [1 ..n ] of n integers and an integer k , find if the set contains two distinct elements
Given a sorted set (array) A[1..n] of n integers and an integer k, find if the set contains two distinct elements a and b such that a + b = k.
Describe the algorithm, and analyze the running time.
**Please explain in detail
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
