Approach 2: Quicksort using list comprehension

Author: PTHARRISH

DSA/quick sort.py

@@ -25,3 +25,19 @@
 # print('Sorted Array in Ascending Order:')
 # print(data)
 
+# Approach 2: Quicksort using list comprehension
+
+# def quicksort(arr):
+# 	if len(arr) <= 1:
+# 		return arr
+# 	else:
+# 		pivot = arr[0]
+# 		left = [x for x in arr[1:] if x < pivot]
+# 		right = [x for x in arr[1:] if x >= pivot]
+# 		return quicksort(left) + [pivot] + quicksort(right)
+
+# # Example usage
+# arr = [1, 7, 4, 1, 10, 9, -2]
+# sorted_arr = quicksort(arr)
+# print("Sorted Array in Ascending Order:")
+# print(sorted_arr)

search.py

@@ -65,49 +65,4 @@
 # result=search(arr,0,len(arr),v)
 # print(result)
 
-# def partition(data,l,r):
-#     pivot=data[r]
-#     i=l-1#0
-#     for j in range(l,r):
-#         if data[j]<=pivot:
-#             i=i+1
-#             (data[i],data[j])=(data[j],data[i])
-#     (data[i+1],data[r])=(data[r],data[i+1])
-#     return i+1
 
-
-
-# def quickSort(data,l,r):
-#     if l<r:
-#         pi=partition(data,l,r)
-#         quickSort(data,l,pi-1)
-#         quickSort(data,pi+1,r)
-
-
-
-# data=[1,7,4,1,10,9,-2]
-# print("Unsorted Array")
-# print(data) 
-# r=len(data)-1
-# print(r)
-# quickSort(data,0,r)
-# print('Sorted Array in Ascending Order:')
-# print(data)
-
-
-# Approach 2: Quicksort using list comprehension
-
-# def quicksort(arr):
-# 	if len(arr) <= 1:
-# 		return arr
-# 	else:
-# 		pivot = arr[0]
-# 		left = [x for x in arr[1:] if x < pivot]
-# 		right = [x for x in arr[1:] if x >= pivot]
-# 		return quicksort(left) + [pivot] + quicksort(right)
-
-# # Example usage
-# arr = [1, 7, 4, 1, 10, 9, -2]
-# sorted_arr = quicksort(arr)
-# print("Sorted Array in Ascending Order:")
-# print(sorted_arr)