JSFiddle - React, Tailwind, and code Playground

by Bala_chandran

JavaScript

// prime number

/* var n = 100;
for (var i = 2; i <= n; i++) {
  for (var j = 2; j <= i; j++) {
    if (i % j === 0)
    break;
  }
  if (i === j)
    console.log("Prime No", i);
}
*/

// prime number with Square root
/*var n = 100;
debugger;
for (var i = 2; i <= n; i++) {
  var srootValue = Math.ceil(Math.sqrt(i));
  var isPrime = true;
  for (var j = 2; j <= srootValue; j++) {
    if (i % j === 0) {
      isPrime = false;
      break;
    }

  }
  if (isPrime) {
    console.log("Prime No", i);
  }

}*/



/*function findArmstrong(n) {
  if (n <= 0) {
    return 0;
  } else {
    var mod = n % 10;
    return (mod * mod * mod) + findArmstrong( parseInt(n / 10));
  }
}

console.log(findArmstrong(1634));
*/

/*var a = [2,56,6,34,23,123,3,5,7,342];
function findMax(max,i){
	if(i == a.length){
  	return max;
  } else{
  	if(max < a[i]){
    	max = a[i];
    }
  	return findMax(max,i+1);
  }
}

console.log(findMax(0,0));*/


/*var a = [2, 56, 6, 34, 23, 123, 3, 5, 7, 342];

function findMin(min, i, arr) {
debugger;
  if (i == arr.length) {
    return min;
  } else {
    if (min > arr[i + 1]) {
      min = arr[i + 1];
    }
    return findMin(min,++i,arr);
  }

}
console.log(findMin(a[0],1,a));*/

// swap 2 numbers without using temp 

var a=10,b=5;
a=a+b; //c 15
b=a-b; //10
a=a-b; //5
console.log('a :'+ a +'b :' + b);