Update index.html

Author: asyncker

index.html

@@ -227,15 +227,15 @@ <h2>Editor</h2>
 }
 
 function eulerTotient(n) {
-    const seq = [];
-    for (let i = 1; i <= n; i++) {
-        let count = 0;
-        for (let j = 1; j <= i; j++) {
-            if (gcd(i, j) === 1) count++;
-        }
-        seq.push(count);
+  const seq = [];
+  for (let i = 1; i <= n; i++) {
+    let count = 0;
+    for (let j = 1; j <= i; j++) {
+      if (gcd(i, j) === 1) count++;
     }
-    return seq;
+    seq.push(count);
+  }
+  return seq;
 }
 
 function binomial(n, k) {
@@ -426,7 +426,9 @@ <h2>Editor</h2>
 }
 
 function count(arr) {
-  const max = Math.max(...arr);
+  if (!arr.length) return [];
+  const max = arr.reduce((m, x) => (x > m ? x : m), -Infinity);
+  if (!Number.isFinite(max)) throw new Error('max is not finite');
   const sorted = [...arr].sort((a, b) => a - b);
   const result = [];
   let countv = 0;
@@ -441,6 +443,27 @@ <h2>Editor</h2>
   return result;
 }
 
+function acount(countArr) {
+  if (!countArr.length) return [];
+  const result = [];
+  for (let i = 0; i < countArr.length; i++) {
+    const prev = i === 0 ? 0 : countArr[i - 1];
+    const freq = countArr[i] - prev;
+    for (let k = 0; k < freq; k++) {
+      result.push(i);
+    }
+  }
+  return result;
+}
+
+function toarray(f, n = 200000, start = 0) {
+  const result = [];
+  for (let i = 0; i < n; i++) {
+    result.push(f(start + i));
+  }
+  return result;
+}
+
 function li(x) {
   if (x < 2) return 0;
   const a = 2;