Optimize code

.gitignore

@@ -0,0 +1,160 @@
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+*.py,cover
+.hypothesis/
+.pytest_cache/
+cover/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+db.sqlite3-journal
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+.pybuilder/
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+#   For a library or package, you might want to ignore these files since the code is
+#   intended to run in multiple environments; otherwise, check them in:
+# .python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don't work, or not
+#   install all needed dependencies.
+#Pipfile.lock
+
+# poetry
+#   Similar to Pipfile.lock, it is generally recommended to include poetry.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+#   https://python-poetry.org/docs/basic-usage/#commit-your-poetrylock-file-to-version-control
+#poetry.lock
+
+# pdm
+#   Similar to Pipfile.lock, it is generally recommended to include pdm.lock in version control.
+#pdm.lock
+#   pdm stores project-wide configurations in .pdm.toml, but it is recommended to not include it
+#   in version control.
+#   https://pdm.fming.dev/#use-with-ide
+.pdm.toml
+
+# PEP 582; used by e.g. github.com/David-OConnor/pyflow and github.com/pdm-project/pdm
+__pypackages__/
+
+# Celery stuff
+celerybeat-schedule
+celerybeat.pid
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/
+
+# pytype static type analyzer
+.pytype/
+
+# Cython debug symbols
+cython_debug/
+
+# PyCharm
+#  JetBrains specific template is maintained in a separate JetBrains.gitignore that can
+#  be found at https://github.com/github/gitignore/blob/main/Global/JetBrains.gitignore
+#  and can be added to the global gitignore or merged into this file.  For a more nuclear
+#  option (not recommended) you can uncomment the following to ignore the entire idea folder.
+#.idea/

project.py

@@ -1,32 +1,45 @@
-print("helloWorld")
-# Python program to print all Primes Smaller 
-# than or equal to N using Sieve of Eratosthenes
+'''Python program to print all Primes Smaller than or equal to N using Sieve of Eratosthenes'''
+import time
+import math
   
-  
-def SieveOfEratosthenes(num):
-    prime = [True for i in range(num+1)]
-# boolean array
+def sieve_of_eratosthenes(num: int) -> list[int]:
+    """Finds all prime number from 1 to num.
+    
+    Args:
+        num (int): Number up to which the prime numbers should be printed
+    
+    Returns:
+        list[int]: List of prime numbers
+    """
+    # boolean list
+    prime = [True] * (num+1)
     p = 2
-    while (p * p <= num):
-  
+    while p <= math.sqrt(num):
         # If prime[p] is not
         # changed, then it is a prime
-        if (prime[p] == True):
-  
-            # Updating all multiples of p
-            for i in range(p * p, num+1, p):
-                prime[i] = False
-        p += 1
-  
-    # Print all prime numbers
-    for p in range(2, num+1):
         if prime[p]:
-            print(p)
+            i = (p << 1)
+            # Updating all multiples of p
+            while i <= num:
+                prime[i] = False
+                i += p
+        p += 1
+    return [p for p in range(2, num+1) if prime[p]]
+
+
+def print_sieve(num: int) -> None:
+    """Prints all prime number from 1 to num.
+
+    Args:
+        num (int): Number up to which the prime numbers should be printed
+    """
+    for number in sieve_of_eratosthenes(num):
+        print(number, end=" ")
   
   
 # Driver code
 if __name__ == '__main__':
-    num = 50
+    num = 3000
     print("Following are the prime numbers smaller"),
     print("than or equal to", num)
-    SieveOfEratosthenes(num)
+    print_sieve(num)