MS algo

by Yogesh Rathod

JavaScript

// Write a javascript function that takes an array of
// integers as input and returns true if sum of any 
// 2 numbers is present in the array or false if the sum does
// not exist
//Examples [1,2,3]=> true [7,3,5,2,4]=>true, [2,17,9,10]=>false

//7 == (3,5) or (3,2)==7 or (3,4)==7
//7 == (5+2) ==7 or (5+4) == 7
//7 == (2+4)
//var a =  [1,2,3]
var a =   [7,3,5,2,4]
    function isExists(arr,m){
    var n = arr.length;
      for(var i1=0;i1 < n;i1++){
        if(m == arr[i1])
           return true;
       }
       return false;
    }
function solve(arr){
var n = arr.length;
//console.log(n)
  for(var i=0;i< n-1;i++) {
    for(var j=i+1;j < n;j++){
        //console.log(i +' ' + j ': arr[i]+arr[j])
        if(isExists(arr,arr[i]+arr[j])){
        // alert(i +' '+ j)
         return true;
        }
       }
     }
		return false; 
}

//console.log("[1,2,3]==>"+solve( [1,2,3] ) );
//console.log("[7,3,5,2,4]==>"+solve( [7,3,5,2,4] ) );
console.log("[7,3,5,2,4]==>"+solve(a) );
//console.log("[2,17,9,10]==>"+solve( [2,17,9,10] ) );