algokit-py 0.4.0__tar.gz → 0.4.1__tar.gz

{algokit_py-0.4.0 → algokit_py-0.4.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algokit-py
-Version: 0.4.0
+Version: 0.4.1
 Summary: A minimal Python algorithms library with clean implementations of search algorithms and sort algorithms
 Author: Chanaka Prasanna
 License: MIT
@@ -24,7 +24,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))
-
+- Quick Sort (in-place, average O(n log n))
 ## Usage
 
 ### Install
@@ -43,12 +43,19 @@ print(binary_search([1, 2, 3], 2))
 
 ### Sorting
 ```python
-from algokit_py.sort import insertion_sort, merge_sort
+from algokit_py.sort import insertion_sort, merge_sort, quick_sort
 
 data = [3, 1, 2]
 
+# Insertion Sort (in-place)
 insertion_sort(data)
 print(data)  # [1, 2, 3]
 
+# Merge Sort (returns new list)
 print(merge_sort([3, 1, 2]))  # [1, 2, 3]
+
+# Quick Sort (in-place)
+data = [3, 1, 2]
+quick_sort(data)
+print(data)  # [1, 2, 3]
 ```

{algokit_py-0.4.0 → algokit_py-0.4.1}/README.md

@@ -12,7 +12,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))
-
+- Quick Sort (in-place, average O(n log n))
 ## Usage
 
 ### Install
@@ -31,12 +31,19 @@ print(binary_search([1, 2, 3], 2))
 
 ### Sorting
 ```python
-from algokit_py.sort import insertion_sort, merge_sort
+from algokit_py.sort import insertion_sort, merge_sort, quick_sort
 
 data = [3, 1, 2]
 
+# Insertion Sort (in-place)
 insertion_sort(data)
 print(data)  # [1, 2, 3]
 
+# Merge Sort (returns new list)
 print(merge_sort([3, 1, 2]))  # [1, 2, 3]
+
+# Quick Sort (in-place)
+data = [3, 1, 2]
+quick_sort(data)
+print(data)  # [1, 2, 3]
 ```

{algokit_py-0.4.0 → algokit_py-0.4.1}/algokit_py/sort/quick.py

@@ -1,6 +1,6 @@
 from typing import TypeVar, MutableSequence
 
-T =  TypeVar("T")
+T = TypeVar("T")
 
 # We use mutable sequence because we need to modify the list in place
 def quick_sort(sequence: MutableSequence[T]):

{algokit_py-0.4.0 → algokit_py-0.4.1}/algokit_py.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: algokit-py
-Version: 0.4.0
+Version: 0.4.1
 Summary: A minimal Python algorithms library with clean implementations of search algorithms and sort algorithms
 Author: Chanaka Prasanna
 License: MIT
@@ -24,7 +24,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))
-
+- Quick Sort (in-place, average O(n log n))
 ## Usage
 
 ### Install
@@ -43,12 +43,19 @@ print(binary_search([1, 2, 3], 2))
 
 ### Sorting
 ```python
-from algokit_py.sort import insertion_sort, merge_sort
+from algokit_py.sort import insertion_sort, merge_sort, quick_sort
 
 data = [3, 1, 2]
 
+# Insertion Sort (in-place)
 insertion_sort(data)
 print(data)  # [1, 2, 3]
 
+# Merge Sort (returns new list)
 print(merge_sort([3, 1, 2]))  # [1, 2, 3]
+
+# Quick Sort (in-place)
+data = [3, 1, 2]
+quick_sort(data)
+print(data)  # [1, 2, 3]
 ```

{algokit_py-0.4.0 → algokit_py-0.4.1}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "algokit-py"
-version = "0.4.0"
+version = "0.4.1"
 description = "A minimal Python algorithms library with clean implementations of search algorithms and sort algorithms"
 readme = "README.md"
 requires-python = ">=3.9"