Create Quick sort algorithm

This repository contains a Python implementation of the Quick Sort algorithm. Quick Sort is an efficient, comparison-based sorting algorithm that follows the divide-and-conquer approach. It picks a pivot element, partitions the array into elements less than the pivot, equal to the pivot, and greater than the pivot, then recursively sorts the sub-arrays.

Features:
Pivot Selection: The algorithm uses the middle element as the pivot to partition the array.
Recursive Sorting: The array is recursively divided into smaller sub-arrays, which are sorted independently.
Time Complexity: Average-case time complexity is O(n log n), and worst-case time complexity is O(n²), but with randomized pivot selection, the average-case performance is optimal.

Author: SamriddhaPathak

Quick sort algorithm

@@ -0,0 +1,15 @@
+#Quick Sort algortitm
+def quick_sort(arr):
+    if len(arr) <= 1:
+        return arr
+    else:
+        pivot = arr[len(arr) // 2]
+        left = [x for x in arr if x < pivot]
+        middle = [x for x in arr if x == pivot]
+        right = [x for x in arr if x > pivot]
+        return quick_sort(left) + middle + quick_sort(right)
+
+# Example usage:
+arr = [10, 7, 8, 9, 1, 5]
+sorted_arr = quick_sort(arr)
+print("Sorted array:", sorted_arr)