Question

Please solve this problem using Python

Write a quicksort method that accept a list of numbers and use list comprehension to construct the method. Note that you need to sort the numbers in descending order .
You MUST use List Comprehension to do the sorting

Your program should contain the function with format shown as below:
def quicksort(a):
# Your codes here. Use List Comprehension and return the result.

Answer 1

Code-

def quicksort(a):
#quicksort using list comprehensions
if a == []: #if list is empty
return []
else:
pivot = a[0]
greater = quicksort([x for x in list[1:] if x < pivot])
lesser = quicksort([x for x in list[1:] if x >= pivot])
return lesser + [pivot] + greater

numbers = (1,6,3,32,8,23,9,12,20,33)
print('sorted list in descending order is:')
print(qsort1(numbers))

Output-

sorted list in descending order is:
[33, 32, 23, 20, 12, 9, 8, 6, 3, 1]

Code-

1 def quicksort(a): #quicksort using list comprehensions if a ] return [] else: 2 3 #if list is empty 4 6 pivot greater lesser a[0] quicksort([x for x in list [1:] if x < pivot]) quicksort([x for x in list[1:] if x >= pivot]) 7 8 return lesser [pivot] + greater 9 0 11 numbers 12 print('sorted list in descending order is:') 3 print(qsort1(numbers)) (1,6,3,32,8, 23,9, 12, 20, 33)

Output-

sorted list in descending order is [33, 32, 23, 20, 12, 9, 8, 6, 3, 1]