Upload New File

PythonIntroNotebooks/functions.py

+import random
+import multiprocessing
+import math
+def producer(queue, n_items):
+    for _ in range(n_items):
+        num = random.randint(1, 100)
+        print("Producer: Produced:", num)
+        queue.put(num)
+    queue.put(None)  # None value to signal consumers to stop
+
+def consumer(queue):
+    while True:
+        item = queue.get()
+        if item is None:  # None value received, stop the consumer
+            break
+        processed_item = item * 2
+        print("Consumer: Consumed ",item, "Processed ",processed_item)
+        
+
+def count_divisors(n):
+    """Calculates the number of divisors for a given integer n.
+
+    Args:
+        n: The integer for which to count divisors.
+
+    Returns:
+        The number of divisors of n.
+    """
+
+    count = 0
+    sqrt_n = int(math.sqrt(n))  # Optimization: only check up to the square root
+
+    for i in range(1, sqrt_n + 1):
+        if n % i == 0:
+            count += 2  # i and n/i are both divisors
+
+    if sqrt_n * sqrt_n == n: # if n is a perfect square, we counted the square root twice
+        count -= 1  # Avoid double-counting the square root
+
+    return count
+
+def sequential_processing(numbers):
+    """Calculate number of divisors sequentially."""
+    results = []
+    for num in numbers:
+        results.append(count_divisors(num))
+    return results
+
+def parallel_processing(numbers,cores):
+    """Calculate number of divisors in parallel using a Pool."""
+    with multiprocessing.Pool(processes=cores) as pool:
+        results = pool.map(count_divisors, numbers)
+    return results