check for pair in A[] with sum as x

Basic solution in JavaScript by Shaikh Arbaaz

by arbaazshaikh919

JavaScript

var arr = [7,5,10,-5,9,14,45,77,5,3];
var arrLen = arr.length;
var sum = 15;

function findSumOfArrayInGiven (arr, arrLen, sum){
  var left = 0;
  var right = arrLen - 1;
  
  arr = arr.sort(function(a, b) {
    return a - b;
  })
  
  while(left < right){
    if(arr[left] + arr[right] === sum){
      return {
          res : true,
          matchNum: arr[left] + ' + ' + arr[right]
      };
    }else if(arr[left] + arr[right] < sum){
      left++;
    }else{
      right--;
    }
  }
  return 0;
}

  var resp = findSumOfArrayInGiven (arr, arrLen, sum);
  
  if(resp.res === true){
    document.write('Matching Numbers are: ' + resp.matchNum +' = '+ sum);
  }else{
    document.write('There are no matching numbers');
  }