quick error fixed for the prettier rest the code is same

Author: Sumit210106

Maths/MobiusFunction.js

@@ -28,6 +28,6 @@ export const mobiusFunction = (number) => {
   return primeFactorsArray.length !== new Set(primeFactorsArray).size
     ? 0
     : primeFactorsArray.length % 2 === 0
-    ? 1
-    : -1
+      ? 1
+      : -1
 }

Maths/SieveOfEratosthenes.js

@@ -9,35 +9,33 @@
  * sieveOfEratosthenes(20) // ====> [2, 3, 5, 7, 11, 13, 17, 19]
  */
 function sieveOfEratosthenes(max) {
-  if (max < 2) return [];
+  if (max < 2) return []
 
-    // Initialize sieve array, false means "potentially prime"
-  const sieve = Array(max + 1).fill(false);
-  const primes = [2]; // Include 2, the only even prime
+  // Initialize sieve array, false means "potentially prime"
+  const sieve = Array(max + 1).fill(false)
+  const primes = [2] // Include 2, the only even prime
 
-    // start from 3 to mark odd numbers only
+  // start from 3 to mark odd numbers only
   for (let i = 3; i * i <= max; i += 2) {
     if (!sieve[i]) {
-        
       // Mark all odd multiples of i starting from i*i as composite
       for (let j = i * i; j <= max; j += 2 * i) {
-        sieve[j] = true;
+        sieve[j] = true
       }
     }
   }
 
   // Collect all odd primes greater than 2
   for (let k = 3; k <= max; k += 2) {
-    if (!sieve[k]) primes.push(k);
+    if (!sieve[k]) primes.push(k)
   }
 
-  return primes;
+  return primes
 }
 
-export { sieveOfEratosthenes };
-
+export { sieveOfEratosthenes }
 
 // i reduced the memory usage by half -> removed the even numbers from the sieve array
 // i reduced the number of iterations by half -> iterating only over odd numbers
 // i reduced the number of inner loop iterations by half -> marking only odd multiples of each prime
-// overall time complexity remains O(n log log n) but with a smaller constant factor due to fewer operations
+// overall time complexity remains O(n log log n) but with a smaller constant factor due to fewer operations