Objective: Write an algorithm to find out whether in a given array there exists or not two numbers whose sum is exactly equals to a given number. This problem has been asked in Amazon and Microsoft interviews.
Input: An array arrA, A number k
Output: True or false based upon we have found any two numbers in array arrA whose sum is equal to k
Method 1: Using Binary Search