quicksortpy 0.1.0__tar.gz

quicksortpy-0.1.0/PKG-INFO

@@ -0,0 +1,22 @@
+Metadata-Version: 2.4
+Name: quicksortpy
+Version: 0.1.0
+Summary: A simple quicksort implementation
+Author: RapidDragon2612
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+
+The QuickSortPy library (by RapidDragon2612) is a working python implementation of the quick sort algorithm.
+Quick sort is widely considered to be the fastest and most efficient sorting algorithm.
+
+To use QuickSortPy, run:
+
+import quicksortpy
+
+And then use the quicksortpy.sort() function, with the argument of the array which is to be sorted:
+
+quicksortpy.sort(example_array)
+
+This modifies the original array, but also returns the array as an output which can be used like so:
+
+sorted_array = quicksortpy.sort(original_array)

quicksortpy-0.1.0/README.md

@@ -0,0 +1,14 @@
+The QuickSortPy library (by RapidDragon2612) is a working python implementation of the quick sort algorithm.
+Quick sort is widely considered to be the fastest and most efficient sorting algorithm.
+
+To use QuickSortPy, run:
+
+import quicksortpy
+
+And then use the quicksortpy.sort() function, with the argument of the array which is to be sorted:
+
+quicksortpy.sort(example_array)
+
+This modifies the original array, but also returns the array as an output which can be used like so:
+
+sorted_array = quicksortpy.sort(original_array)

quicksortpy-0.1.0/pyproject.toml

@@ -0,0 +1,13 @@
+[project]
+name = "quicksortpy"
+version = "0.1.0"
+description = "A simple quicksort implementation"
+readme = "README.md"
+requires-python = ">=3.8"
+authors = [
+    { name = "RapidDragon2612" }
+]
+
+[build-system]
+requires = ["setuptools>=61.0"]
+build-backend = "setuptools.build_meta"

quicksortpy-0.1.0/quicksortpy/__init__.py

@@ -0,0 +1,3 @@
+from .quick_sort import sort
+
+__all__ = ["sort"]

quicksortpy-0.1.0/quicksortpy/quick_sort.py

@@ -0,0 +1,25 @@
+def partition(arr, low, high):
+    pivot = arr[high]
+
+    swap_idx = low - 1
+
+    for curr_idx in range(low, high):
+        if arr[curr_idx] <= pivot:
+            swap_idx += 1
+            arr[swap_idx], arr[curr_idx] = arr[curr_idx], arr[swap_idx]
+
+    arr[swap_idx + 1], arr[high] = arr[high], arr[swap_idx + 1]
+
+    return swap_idx + 1
+
+
+def sort(arr, low=0, high=None):
+    if high is None:
+        high = len(arr) - 1
+
+    if not low >= high:
+        pivot_idx = partition(arr, low, high)
+        sort(arr, pivot_idx + 1, high)
+        sort(arr, low, pivot_idx - 1)
+
+    return arr

quicksortpy-0.1.0/quicksortpy.egg-info/PKG-INFO

@@ -0,0 +1,22 @@
+Metadata-Version: 2.4
+Name: quicksortpy
+Version: 0.1.0
+Summary: A simple quicksort implementation
+Author: RapidDragon2612
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+
+The QuickSortPy library (by RapidDragon2612) is a working python implementation of the quick sort algorithm.
+Quick sort is widely considered to be the fastest and most efficient sorting algorithm.
+
+To use QuickSortPy, run:
+
+import quicksortpy
+
+And then use the quicksortpy.sort() function, with the argument of the array which is to be sorted:
+
+quicksortpy.sort(example_array)
+
+This modifies the original array, but also returns the array as an output which can be used like so:
+
+sorted_array = quicksortpy.sort(original_array)

quicksortpy-0.1.0/quicksortpy.egg-info/SOURCES.txt

@@ -0,0 +1,8 @@
+README.md
+pyproject.toml
+quicksortpy/__init__.py
+quicksortpy/quick_sort.py
+quicksortpy.egg-info/PKG-INFO
+quicksortpy.egg-info/SOURCES.txt
+quicksortpy.egg-info/dependency_links.txt
+quicksortpy.egg-info/top_level.txt

quicksortpy-0.1.0/quicksortpy.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

quicksortpy-0.1.0/quicksortpy.egg-info/top_level.txt

@@ -0,0 +1 @@
+quicksortpy

quicksortpy-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+