From f4a0576f3c71e1c30f793ecda5a00921b34c913f Mon Sep 17 00:00:00 2001
From: Nils Pukropp <nils@narl.io>
Date: Tue, 30 Jan 2024 02:14:10 +0100
Subject: [PATCH] added template file

---
 loops/primes/bak       | 12 ------------
 loops/primes/primes.py | 34 +++++-----------------------------
 2 files changed, 5 insertions(+), 41 deletions(-)
 delete mode 100644 loops/primes/bak

diff --git a/loops/primes/bak b/loops/primes/bak
deleted file mode 100644
index 71e6971..0000000
--- a/loops/primes/bak
+++ /dev/null
@@ -1,12 +0,0 @@
-def is_prime(n: int) -> bool:
-    # TODO: implement
-    return False
-
-
-def next_prime(n: int) -> int:
-    return -1
-
-
-def prime_factorize(n: int) -> list[int]:
-    # TODO: implement
-    return []
diff --git a/loops/primes/primes.py b/loops/primes/primes.py
index 093bb90..71e6971 100644
--- a/loops/primes/primes.py
+++ b/loops/primes/primes.py
@@ -1,36 +1,12 @@
 def is_prime(n: int) -> bool:
-    if n < 2:
-        return False
-
-    for i in range(2, n // 2 + 1):
-        if n % i == 0:
-            return False
-
-    return True
+    # TODO: implement
+    return False
 
 
 def next_prime(n: int) -> int:
-    return n + 1 if is_prime(n + 1) else next_prime(n + 1)
+    return -1
 
 
-def next_prime_iterative(n: int) -> int:
-    num = n + 1
-    while not is_prime(num):
-        num += 1
-    return num
-
 def prime_factorize(n: int) -> list[int]:
-    prime_factors: list[int] = []
-    num = n
-    prime = 2
-    while num > 1:
-        if num % prime == 0:
-            prime_factors.append(prime)
-            num //= prime
-            prime = 2
-        else:
-            prime = next_prime(prime)
-    return prime_factors
-
-if __name__ == "__main__":
-    prime_factorize(10)
\ No newline at end of file
+    # TODO: implement
+    return []