From 609459a03456a5b69fc3fade29dd98dbf35d88bd Mon Sep 17 00:00:00 2001
From: derailed-dash <darren_lester@epam.com>
Date: Sun, 19 Nov 2023 19:42:13 +0000
Subject: [PATCH] Algorithms update

---
 docs/python/useful_algorithms.md | 106 ++++++++++++++++++++++++++++++-
 1 file changed, 104 insertions(+), 2 deletions(-)

diff --git a/docs/python/useful_algorithms.md b/docs/python/useful_algorithms.md
index 5953db2e..9a90cc51 100644
--- a/docs/python/useful_algorithms.md
+++ b/docs/python/useful_algorithms.md
@@ -15,10 +15,13 @@ tags:
 - [Overview](#overview)
 - [Merging Overlapping Intervals](#merging-overlapping-intervals)
 - [Binary Search](#binary-search)
+- [Get Factors](#get-factors)
+- [To Base-N](#to-base-n)
+- [Timer Decorator](#timer-decorator)
 
 ## Overview
 
-Just a set of useful reusable algorithms...
+I've written a bunch of algorithms which I find useful and reusable... 
 
 ## Merging Overlapping Intervals
 
@@ -75,4 +78,103 @@ def binary_search(target, low:int, high:int, func, *func_args, reverse_search=Fa
             low = candidate
         else:
             high = candidate
-```
\ No newline at end of file
+```
+
+## Get Factors
+
+Here is a function that returns all the factors for a given integer. Note how I'm making use of the `cache` decorator, in order to cache the factors of any integer that has been seen before.
+
+```python
+@cache
+def get_factors(num: int) -> set[int]:
+    """ Gets the factors for a given number. Returns a set[int] of factors. 
+        # E.g. when num=8, factors will be 1, 2, 4, 8 """
+    factors = set()
+
+    # Iterate from 1 to sqrt of 8,  
+    # since a larger factor of num must be a multiple of a smaller factor already checked
+    for i in range(1, int(num**0.5) + 1):  # e.g. with num=8, this is range(1, 3)
+        if num % i == 0: # if it is a factor, then dividing num by it will yield no remainder
+            factors.add(i)  # e.g. 1, 2
+            factors.add(num//i)  # i.e. 8//1 = 8, 8//2 = 4
+    
+    return factors
+```
+
+## To Base-N
+
+This function returns the string representation of an integer, after conversion to any arbitrary base.
+
+```python
+def to_base_n(number: int, base: int):
+    """ Convert any integer number into a base-n string representation of that number.
+    E.g. to_base_n(38, 5) = 123
+
+    Args:
+        number (int): The number to convert
+        base (int): The base to apply
+
+    Returns:
+        [str]: The string representation of the number
+    """
+    ret_str = ""
+    curr_num = number
+    while curr_num:
+        ret_str = str(curr_num % base) + ret_str
+        curr_num //= base
+
+    return ret_str if number > 0 else "0"
+```
+
+## Timer Decorator
+
+A Python **decorator** is essentially a function that is used to modify or extend the behavior of other functions or methods. It allows for the addition of functionality to an existing piece of code without changing its structure. This is particularly useful for code reusability, separation of concerns, and adhering to the DRY (Don't Repeat Yourself) principle.
+
+In Python, decorators are applied by prefixing a function definition with `@decorator-name`. When a function is decorated, it is passed to the decorator as an argument, and the decorator returns a new function with the enhanced functionality.
+
+I found myself writing this code all the time:
+
+```python
+if __name__ == "__main__":
+    t1 = time.perf_counter()
+    main()
+    t2 = time.perf_counter()
+    print(f"Execution time: {t2 - t1:0.4f} seconds")
+```
+
+I figured... this is a great candidate for a decorator! And here it is:
+
+```python
+@contextlib.contextmanager
+def timer(description="Execution time"):
+    """A context manager to measure the time taken by a block of code or function.
+    
+    Args:
+    - description (str): A description for the timing output. 
+      Default is "Execution time".
+    """
+    t1 = time.perf_counter()
+    yield
+    t2 = time.perf_counter()
+    logger.info(f"{description}: {t2 - t1:.3f} seconds")
+```
+
+It works like this:
+
+- I use an existing decorator - `@contextlib.contextmanager` - to turn my function into a resource that we can invoke using the `with` statement.
+- Inside the function:
+  - `t1` is set to the current time using `time.perf_counter()`.
+  - The `yield` statement pauses the function, allowing the block of code within the `with` statement to execute. The context manager waits at this point until the block completes its execution.
+  - After the block inside the `with` statement finishes, execution resumes in the `timer` function. `t2` is set to the current time, again using `time.perf_counter()`.
+  - The function then calculates the duration the code block took to execute by subtracting `t1` from `t2`. This duration is then logged with the provided description.
+
+So now, I can use the `timer` decorator like this:
+
+```python
+import aoc_common.aoc_commons as ac
+
+with ac.timer():
+    logger.info(f"Part 1 soln={part1(input_data)}")
+```
+
+Much better!
\ No newline at end of file