algorithm: add HornerScheme algorithm

Saimon398 · Saimon398 · commit b88854880717 · 2022-10-29T16:02:35.000+03:00
This algorithm allows to convert number from decimal
number system to another one (from 2 to 10)
diff --git a/Maths/HornerScheme.js b/Maths/HornerScheme.js
@@ -0,0 +1,38 @@
+/**
+ * @function hornerScheme
+ * @description Convert a number from decimal system to another (till decimal)
+ * @param {Number} number Number to be converted
+ * @param {Number} base Base of new number system
+ * @returns {String} Converted Number
+ * @see [HornerMethod](https://en.wikipedia.org/wiki/Horner%27s_method)
+ * @example
+ * const num1 = 125 // Needs to be converted to the binary number system
+ * gornerScheme(num, 2); // ===> 1111101
+ * @example
+ * const num2 = 125 // Needs to be converted to the octal number system
+ * gornerScheme(num, 8); // ===> 175
+ */
+const hornerScheme = (number, base) => {
+  if (typeof number !== 'number' || typeof base !== 'number') {
+    throw new Error('Input data must be numbers')
+  }
+  // Zero in any number system is zero
+  if (number === 0) {
+    return `${number}`
+  }
+  let absoluteValue = Math.abs(number)
+  let convertedNumber = ''
+  while (absoluteValue > 0) {
+    // Every iteration last digit is taken away
+    // and added to the previois one
+    const lastDigit = absoluteValue % base
+    convertedNumber = lastDigit + convertedNumber
+    absoluteValue = Math.trunc(absoluteValue / base)
+  }
+  // Result is whether negative or positive,
+  // depending on the original value
+  const result = number < 0 ? `-${convertedNumber}` : convertedNumber
+  return result
+}
+
+export { hornerScheme }
