hcf.js

	function hcf(n1, n2){
		var hcf = (n1 > n2) ? findHcf(n2, n1) : findHcf(n1, n2);
		console.log("HCF of ", n1, " & ", n2, " is ", hcf);
	}

	function findHcf(b, a) {
		console.log("Divisor : ", b," Dividend: ", a);
		var q, r;
		q = Math.floor(a/b);
		r = a - b*q;
		console.log("Quotient : ", q," Remainder: ", r);
		if( r !== 0 ) {
			console.warn("WE HAVE TO DIVIDE AGAIN");
			return arguments.callee(r, b);
		} else {
			console.debug("REMAINDER IS ZERO. THE END OF DIVISION.");
			return b;
		}
	}

Wrote a Basic HCF Finder to show steps to my sister.

Euclids algorithm to calculate gcd or hcf

function hcf(a, b) {
    return (a && b)? hcf(b, a % b): (a || b)
}