From 6e9eba09e9c57d23b9e65060f45870f5ab75d0e3 Mon Sep 17 00:00:00 2001
From: Kodurikeerthana07 <2400033253@kluniversity.in>
Date: Tue, 25 Nov 2025 20:26:07 +0530
Subject: [PATCH] Implement quicksort algorithm in quicksort.phyton

---
 quicksort.phyton | 10 ++++++++++
 1 file changed, 10 insertions(+)
 create mode 100644 quicksort.phyton

diff --git a/quicksort.phyton b/quicksort.phyton
new file mode 100644
index 0000000..3b1f186
--- /dev/null
+++ b/quicksort.phyton
@@ -0,0 +1,10 @@
+def quicksort(arr):
+    if len(arr) <= 1:
+        return arr
+    
+    pivot = arr[len(arr) // 2]        # choose middle element as pivot
+    left = [x for x in arr if x < pivot]     # elements smaller than pivot
+    middle = [x for x in arr if x == pivot]  # elements equal to pivot
+    right = [x for x in arr if x > pivot]    # elements greater than pivot
+    
+    return quicksort(left) + middle + quicksort(right)