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

algokit_py/__init__.py

@@ -3,6 +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, merge_sort
 
-__version__ = "0.1.0"
-__all__ = ["binary_search", "linear_search"]
+__all__ = ["binary_search", "linear_search","insertion_sort","merge_sort"]

algokit_py/search/binary.py

@@ -16,10 +16,11 @@ At every step, the algorithm maintains a range that is guaranteed to contain the
 from typing import Sequence, TypeVar
 
 T = TypeVar('T')
-# here we use Sequence because binary seach does not support for unindexed iterables
+# here we use Sequence because binary search does not support for not indexed iterables.
+# Binary search requires a sorted sequence.
 def binary_search(sequence: Sequence[T], target: T)-> int:
     """
-    This function will perform the binary search
+    This function will perform the binary search. Sequence must be a sorted sequence
 
     :param sequence: sorted and indexed sequence
     :param target: value that you want to find

algokit_py/sort/__init__.py

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

algokit_py/sort/insertion.py

@@ -0,0 +1,26 @@
+from typing import MutableSequence, TypeVar
+
+T = TypeVar('T')
+def insertion_sort(sequence: MutableSequence[T])-> None:
+    """
+    At the start of iteration i, the subarray sequence[0:i] is sorted.
+
+    :param Mutable sequence
+    :return None
+
+    Worst Case Time Complexity: O(n²)
+    Space Complexity: O(1)
+    """
+    length = len(sequence)
+    for i in range(1, length):
+        key = sequence[i]
+        j = i-1
+        while sequence[j] > key and j >= 0:
+            sequence[j+1]= sequence[j]
+            j -= 1
+        sequence[j + 1] = key
+
+
+
+
+

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.1.0.dist-info → algokit_py-0.3.0.dist-info}/METADATA

@@ -1,7 +1,7 @@
 Metadata-Version: 2.4
 Name: algokit-py
-Version: 0.1.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
@@ -12,14 +12,28 @@ Description-Content-Type: text/markdown
 
 # algokit-py
 
-A lightweight Python algorithms library with clean, well-documented implementations.
+A lightweight Python algorithms library with clean, well-documented, and tested implementations.
+Designed for learning, interviews, and real-world algorithm reasoning.
 
 ## Features
+
+### Search Algorithms
 - Linear Search
-- Binary Search
+- Binary Search (iterative, invariant-based)
+
+### Sorting Algorithms
+- Insertion Sort (in-place, stable)
+- Merge Sort (divide-and-conquer, O(n log n))
 
 ## Usage
 
+### Install
+
+```python
+pip install algokit-py
+```
+
+### Search
 ```python
 from algokit_py.search import linear_search, binary_search
 
@@ -27,26 +41,14 @@ print(linear_search([1, 2, 3], 2))
 print(binary_search([1, 2, 3], 2))
 ```
 
+### Sorting
+```python
+from algokit_py.sort import insertion_sort, merge_sort
 
-We will improve this later.
-
----
-
-## STEP 6: Local Install Test (Very Important)
-
-From **project root**:
-
-```powershell
-pip install -e .
-```
-
-Then test:
+data = [3, 1, 2]
 
-```powershell
-python -c "from algokit_py.search import binary_search; print(binary_search([1,2,3], 2))"
-```
+insertion_sort(data)
+print(data)  # [1, 2, 3]
 
-You must see:
-```python
-1
+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.1.0.dist-info → algokit_py-0.3.0.dist-info}/WHEEL

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

algokit_py-0.1.0.dist-info/RECORD

@@ -1,8 +0,0 @@
-algokit_py/__init__.py,sha256=xhI99pue6hsmyVVOCd60YTglScw-RcWssAdGBUg3yNY,193
-algokit_py/search/__init__.py,sha256=0xreC43bjUH_VRqJTv48VbPadrY4GQgP7y3PMQ5RR04,118
-algokit_py/search/binary.py,sha256=3VZ0ZMtANDProjkGZkX1NUpZZPmwfZF5CevpeJ-Bd-Q,1336
-algokit_py/search/linear.py,sha256=07bjqKVarTmYiC0Uw-Pg_EuNRcsAD4zsn9lfuprTJAc,451
-algokit_py-0.1.0.dist-info/METADATA,sha256=E8L-a1xjSM5L-SJoVaQZ7U1kepUg2mB_jvxRDhkPjwo,1041
-algokit_py-0.1.0.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-algokit_py-0.1.0.dist-info/top_level.txt,sha256=OqfCkcr7SFcMZHBQVKnTOy6Plaoq8t0A8M4CN6Hca0w,11
-algokit_py-0.1.0.dist-info/RECORD,,