Question: Input: unsorted array A of n integers. Target sum t. Goal: Write an O(n) time algorithm that determines whether or not there are two numbers
Input: unsorted array A of n integers. Target sum t. Goal: Write an O(n) time algorithm that determines whether or not there are two numbers x,y in A with x +y=t
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
