docs: definition template

Author: praisetompane

2_standard_library/17_concurrent_execution/1_threading.txt

@@ -8,7 +8,7 @@ def thread:
     - intuition: ???
 
     - properties:
-        - specification: 
+        - specification:
             - high level: https://docs.python.org/3.11/library/threading.html
             - low level: https://docs.python.org/3.11/library/_thread.html#module-_thread
         - implementation: https://github.com/python/cpython/blob/main/Lib/threading.py
@@ -21,9 +21,9 @@ def thread:
         - multiple IO-bound tasks:
             - database calls
             - external network services calls
-        
-    - proof: None. It is a definition.
-    
+
+    - proof: none. it is a definition.
+
 References: ???
 
 

2_standard_library/17_concurrent_execution/2_multiprocessing.txt

@@ -7,7 +7,7 @@ def multiprocessing:
 
     - intuition: threading API applied to processes.
 
-    - properties: 
+    - properties:
       - specification: https://docs.python.org/3.11/library/multiprocessing.html
       - implementation:
         - high level: https://github.com/python/cpython/tree/main/Lib/multiprocessing
@@ -16,7 +16,7 @@ def multiprocessing:
 
     - use cases: ???
 
-    - proof: None. It is a definition.
+    - proof: none. it is a definition.
 
 References: ???
 

2_standard_library/4_built_in_types/5_iterator_types/1_iterator.txt

@@ -12,19 +12,19 @@ def iterator:
     - iterator protocol: https://docs.python.org/3/c-api/iter.html
     - types:
       - sequence iterator
-      - callable object + sentinel value iterator    
+      - callable object + sentinel value iterator
     - specification: PEP 234 – Iterators. https://peps.python.org/pep-0234/
     - implementation: https://github.com/python/cpython/blob/main/Objects/iterobject.c
 
     - forward and reserve traversal.
       - can only be traversed once.
-    
+
   - examples: ???
 
   - use cases: ???
-      
-  - proof: None. It is a definition.
-    
+
+  - proof: none. it is a definition.
+
 References:
   The Python Standard Library. 2025. https://docs.python.org/3/glossary.html#term-iterator
 

2_standard_library/4_built_in_types/5_iterator_types/2_generator.txt

@@ -1,4 +1,4 @@
-def generator | generator function: 
+def generator | generator function:
   - formal: 𝑓: * ↦ Generator Iterator
       - in words: a function that creates and returns a Generator Iterator.
 
@@ -18,8 +18,8 @@ def generator | generator function:
     - Just In Time processing: generate values as they become available and return them for processing them at call/client side.
     - create coroutines, which allows interleaving client code with library code:
       - this enables sequencing
-  - proof: None. It is a definition.
-    
+  - proof: none. it is a definition.
+
 References:
   The Python Standard Library. 2025. https://docs.python.org/3/glossary.html#term-generator
 

2_standard_library/4_built_in_types/5_iterator_types/3_generator_expression.txt

@@ -1,4 +1,4 @@
- def generator expression: 
+ def generator expression:
   - formal: expression ↦ Iterator
       - in words: an expression that returns an Iterator.
 
@@ -12,12 +12,12 @@
   - examples:
       1. without an if:
           i*i for i in range(10)
-      2. with an if:  
+      2. with an if:
         j**j for j in range(20) if j%2 == 0
   - use cases: ???
-      
-  - proof: None. It is a definition.
-    
+
+  - proof: none. it is a definition.
+
 References:
   The Python Standard Library. 2025. https://docs.python.org/3/glossary.html#term-generator-iterator
 

4_experiments/4_applications/math/is_prime.py

@@ -8,7 +8,7 @@
 """
 
 
-def isPrime(n):
+def isPrime_1(n):
     for i in range(2, n):
         if n % i == 0:
             return False
@@ -17,7 +17,56 @@ def isPrime(n):
 
 def main():
     for n in range(100):
-        print(n, "is a prime:", isPrime(n))
+        print(n, "is a prime:", isPrime_1(n))
 
 
 main()
+
+
+
+####
+
+"""
+Complexity
+    N == number
+
+    O(N * (N - 1))
+    O(N^2 - N)
+    => O(N^2)
+
+"""
+
+
+def isPrime_2(number):
+    if number > 1:
+        for i in range(1, number):
+            for j in range(2, number):
+                if i * j == number:
+                    return False
+    return True
+
+
+print(isPrime_2(4))
+print(isPrime_2(5))
+
+"""
+    N == number
+    Complexity
+        O(N - 1)
+        => 𝑂(𝑁)
+    prime? == is it divisble by number >= 1 and < number
+
+    Is it divisible by any other number expect 1 and itself
+    hence range 2 to number - 1
+"""
+
+
+def isPrime_3(number):
+    for i in range(2, number):
+        if number % i == 0:
+            return False
+    return True
+
+
+print(isPrime_3(4))
+print(isPrime_3(5))

README.md

@@ -10,7 +10,7 @@
                 - [Python](https://peps.python.org/pep-0007/)
                 - [C](https://peps.python.org/pep-0007/)
         - [Annotations on the actual interpreter implementation](https://github.com/praisetompane/python_implementation_study_cpython)
-            - They are prefixed with "Praise:" 
+            - They are prefixed with "Praise:"
     - Python's design, implementation and ecosystem.
 
 ## Language Details
@@ -29,7 +29,6 @@
         - [pip](https://pip.pypa.io/en/stable/)
         - [pipenv](https://pipenv.pypa.io/en/latest/)
     - [Structuring Projects](https://setuptools.pypa.io/en/stable/userguide/package_discovery.html#src-layout)
-    
 - [Extending and Embedding](https://docs.python.org/3/extending/index.html)
     - [PEP Index](https://www.python.org/dev/peps/)
 - [Developer Contribution Guide](https://devguide.python.org/)