shubham-sharmas/node-js-complex-cpu-intensive-operation.js

## node-js-complex-cpu-intensive-operation.js
const express = require("express");
const app = express();

// Function to check if a number is prime.
function isPrime(num) {
  if (num <= 1) return false;
  if (num <= 3) return true;
  if (num % 2 === 0 || num % 3 === 0) return false;
  for (let i = 5; i * i <= num; i += 6) {
    if (num % i === 0 || num % (i + 2) === 0) return false;
  }
  return true;
}

app.get("/non-blocking-operation", (req, res) => {
  res.send(
    `<html><body><h1>Timetamp: ${Date.now()}</h1><h2>This request is blocked if /complex-blocking-operation is running!!!</h2></body></html>`,
  );
});

app.get("/complex-blocking-operation", (req, res) => {
  const startTime = Date.now();
  // Simulate a compute-intensive operation by finding prime numbers in a large range.
  const maxLimit = 50000000;
  const primes = [];
  for (let i = 2; i < maxLimit; i++) {
    if (isPrime(i)) {
      primes.push(i);
    }
  }

  res.send(
    `<html><body><h1>Timestamp: ${Date.now()}</h1><h2>Max Limit: ${maxLimit}(Million) => Total primes: ${
      primes.length
    } <br />Total Execution Time: ${
      (Date.now() - startTime) / 1000
    } seconds.</h2></body></html>`,
  );
});

const PORT = process.env.PORT || 3000;
app.listen(PORT, () => {
  console.log(`Server is listening on port ${PORT}`);
});
	const express = require("express");
	const app = express();

	// Function to check if a number is prime.
	function isPrime(num) {
	if (num <= 1) return false;
	if (num <= 3) return true;
	if (num % 2 === 0 \|\| num % 3 === 0) return false;
	for (let i = 5; i * i <= num; i += 6) {
	if (num % i === 0 \|\| num % (i + 2) === 0) return false;
	}
	return true;
	}

	app.get("/non-blocking-operation", (req, res) => {
	res.send(
	`<html><body><h1>Timetamp: ${Date.now()}</h1><h2>This request is blocked if /complex-blocking-operation is running!!!</h2></body></html>`,
	);
	});

	app.get("/complex-blocking-operation", (req, res) => {
	const startTime = Date.now();
	// Simulate a compute-intensive operation by finding prime numbers in a large range.
	const maxLimit = 50000000;
	const primes = [];
	for (let i = 2; i < maxLimit; i++) {
	if (isPrime(i)) {
	primes.push(i);
	}
	}

	res.send(
	`<html><body><h1>Timestamp: ${Date.now()}</h1><h2>Max Limit: ${maxLimit}(Million) => Total primes: ${
	primes.length
	} <br />Total Execution Time: ${
	(Date.now() - startTime) / 1000
	} seconds.</h2></body></html>`,
	);
	});

	const PORT = process.env.PORT \|\| 3000;
	app.listen(PORT, () => {
	console.log(`Server is listening on port ${PORT}`);
	});