algokit-py 0.2.0__py3-none-any.whl → 0.3.0__py3-none-any.whl

algokit_py/__init__.py

@@ -3,7 +3,6 @@ algokit_py - A minimal Python algorithms library
 """
 
 from algokit_py.search import binary_search, linear_search
-from algokit_py.sort import insertion_sort
+from algokit_py.sort import insertion_sort, merge_sort
 
-__version__ = "0.1.0"
-__all__ = ["binary_search", "linear_search","insertion_sort"]
+__all__ = ["binary_search", "linear_search","insertion_sort","merge_sort"]

algokit_py/sort/__init__.py

@@ -1 +1,4 @@
-from .insertion import insertion_sort
+from .insertion import insertion_sort
+from .merge import merge_sort
+
+__all__ = ["insertion_sort", "merge_sort"]

algokit_py/sort/insertion.py

@@ -5,7 +5,7 @@ def insertion_sort(sequence: MutableSequence[T])-> None:
     """
     At the start of iteration i, the subarray sequence[0:i] is sorted.
 
-    :param sequence
+    :param Mutable sequence
     :return None
 
     Worst Case Time Complexity: O(n²)

algokit_py/sort/merge.py

@@ -0,0 +1,43 @@
+from typing import Sequence, TypeVar
+
+T = TypeVar('T')
+
+def merge_sort(sequence: Sequence[T]) -> list[T]:
+    """
+    Merge sort implementation.
+
+    Base case:
+    - Sequences of length 0 or 1 are already sorted.
+
+    Worst Case Time Complexity: O(n log n)
+    Space Complexity: O(n)
+    """
+    if len(sequence) <= 1:
+        return list(sequence)
+
+    middle = len(sequence) // 2
+    left = sequence[:middle]
+    right = sequence[middle:]
+
+    sorted_left = merge_sort(left)
+    sorted_right = merge_sort(right)
+
+    merged = []
+    i = j = 0
+
+    while i < len(sorted_left) and j < len(sorted_right):
+        if sorted_left[i] <= sorted_right[j]:
+            merged.append(sorted_left[i])
+            i += 1
+        else:
+            merged.append(sorted_right[j])
+            j += 1
+
+    merged.extend(sorted_left[i:])
+    merged.extend(sorted_right[j:])
+
+    return merged
+
+
+
+

{algokit_py-0.2.0.dist-info → algokit_py-0.3.0.dist-info}/METADATA

@@ -1,7 +1,7 @@
 Metadata-Version: 2.4
 Name: algokit-py
-Version: 0.2.0
-Summary: A minimal Python algorithms library with clean implementations of search algorithms
+Version: 0.3.0
+Summary: A minimal Python algorithms library with clean implementations of search algorithms and sort algorithms
 Author: Chanaka Prasanna
 License: MIT
 Classifier: Programming Language :: Python :: 3
@@ -23,6 +23,7 @@ Designed for learning, interviews, and real-world algorithm reasoning.
 
 ### Sorting Algorithms
 - Insertion Sort (in-place, stable)
+- Merge Sort (divide-and-conquer, O(n log n))
 
 ## Usage
 
@@ -42,9 +43,12 @@ print(binary_search([1, 2, 3], 2))
 
 ### Sorting
 ```python
-from algokit_py.sort import insertion_sort
+from algokit_py.sort import insertion_sort, merge_sort
 
 data = [3, 1, 2]
+
 insertion_sort(data)
-print(data)   # [1, 2, 3]
+print(data)  # [1, 2, 3]
+
+print(merge_sort([3, 1, 2]))  # [1, 2, 3]
 ```

algokit_py-0.3.0.dist-info/RECORD

@@ -0,0 +1,11 @@
+algokit_py/__init__.py,sha256=oo3K29kYB3Ltr-YAwuyN0sSZ85W13FeJo9kFkvIA0a0,256
+algokit_py/search/__init__.py,sha256=0xreC43bjUH_VRqJTv48VbPadrY4GQgP7y3PMQ5RR04,118
+algokit_py/search/binary.py,sha256=y9EXEK2wlFuMU6wQfddrESe4CkL2umfH7K0Vl33vW9g,1421
+algokit_py/search/linear.py,sha256=07bjqKVarTmYiC0Uw-Pg_EuNRcsAD4zsn9lfuprTJAc,451
+algokit_py/sort/__init__.py,sha256=p0TJO8Ou2upoGVh9-sx2sTxKZ1YwUgIiIgTLIT8eE8I,114
+algokit_py/sort/insertion.py,sha256=CFKnfZESHlwa26TrCjTMZ4pGSPyxAWdwO9CFCwBj1Uo,582
+algokit_py/sort/merge.py,sha256=fyyZhGVqhVIV82oj55IkaG9rGDUvdDCKE6nvD5deNEE,926
+algokit_py-0.3.0.dist-info/METADATA,sha256=aCfDmgNamUeyeGPivkPiHCDeKMcB6pr2381cfMSBsMw,1261
+algokit_py-0.3.0.dist-info/WHEEL,sha256=wUyA8OaulRlbfwMtmQsvNngGrxQHAvkKcvRmdizlJi0,92
+algokit_py-0.3.0.dist-info/top_level.txt,sha256=OqfCkcr7SFcMZHBQVKnTOy6Plaoq8t0A8M4CN6Hca0w,11
+algokit_py-0.3.0.dist-info/RECORD,,

{algokit_py-0.2.0.dist-info → algokit_py-0.3.0.dist-info}/WHEEL

@@ -1,5 +1,5 @@
 Wheel-Version: 1.0
-Generator: setuptools (80.10.1)
+Generator: setuptools (80.10.2)
 Root-Is-Purelib: true
 Tag: py3-none-any
 

algokit_py-0.2.0.dist-info/RECORD

@@ -1,10 +0,0 @@
-algokit_py/__init__.py,sha256=a0JaDxWSgNSg4l9Ezc3Q_ERjw4J72lQuYx7__B89Aio,254
-algokit_py/search/__init__.py,sha256=0xreC43bjUH_VRqJTv48VbPadrY4GQgP7y3PMQ5RR04,118
-algokit_py/search/binary.py,sha256=y9EXEK2wlFuMU6wQfddrESe4CkL2umfH7K0Vl33vW9g,1421
-algokit_py/search/linear.py,sha256=07bjqKVarTmYiC0Uw-Pg_EuNRcsAD4zsn9lfuprTJAc,451
-algokit_py/sort/__init__.py,sha256=9U5wHjwlxvPxOo08uud9xYQ_LrbSV2G1BZJWyoee1ck,37
-algokit_py/sort/insertion.py,sha256=JocOHbztnwaLaTtyMUOnJ5o-BaUih60WX_ooTAVfZp4,574
-algokit_py-0.2.0.dist-info/METADATA,sha256=sNuU_10eTJAJz6XTPjvlYzi11t8ISMu8eMwpjsa3sJE,1136
-algokit_py-0.2.0.dist-info/WHEEL,sha256=qELbo2s1Yzl39ZmrAibXA2jjPLUYfnVhUNTlyF1rq0Y,92
-algokit_py-0.2.0.dist-info/top_level.txt,sha256=OqfCkcr7SFcMZHBQVKnTOy6Plaoq8t0A8M4CN6Hca0w,11
-algokit_py-0.2.0.dist-info/RECORD,,