$($python$)$ TASK $1(20$ points$)$: Implement the quick$\_$sort Function, you can reference the code on slides of advanced sorting algorithms

# Run the code to make sure it is working

a$\_$list $=[54,26,93,17,77,31,44,55,20]$

quick$\_$sort$($a$\_$list$)$

print$($a$\_$list$)$

# Task $2(30$ pts$)$: Modify the partition function, instead of using first element of list as pivot

# You will change to choose the last element of list as pivot

# In the test code, you will create a seperate list $**$ b$\_$list$**$ and fill in the b$\_$list with $24$ random values from range$(1,100),$ so the $24$ elements in b$\_$list is from $1$ to $99$ inclusive

# Print the b$\_$list before sorting

#Use the new version of quick$\_$sort $($pivot will be last element of list$)$ to sort the b$\_$list and print it out

b$\_$list$=$

print$($b$\_$list$)$

quick$\_$sort$($b$\_$list$)$

print$($b$\_$list$)$

# Task $3(50)$

# Based on the partition function, created another partition$\_$median, you will apply the algorithm

# Choose the pivot as the median of three on pg$.41-43$

# Create functions: quick$\_$sort$\_$median and quick$\_$sort$\_$median$\_$helper that call partition$\_$median inside

# Test your functions with random generated list, size $24$

c$\_$list$=$

print$($c$\_$list$)$

quick$\_$sort$\_$median$($c$\_$list$)$

print$($c$\_$list$)$

TASK $1(20$ points$)$: Implement the quick$\_$sort Function, you can reference the code on slides of advanced sorting algorithms

# Run the following code to make sure it is working

a$\_$list $=[54,26,93,17,77,31,44,55,20]$

quick$\_$sort$($a$\_$list$)$

print$($a$\_$list$)$

# Task $2(30$ pts$)$: Modify the partition function, instead of using first element of list as pivot

# You will change to choose the last element of list as pivot

# In the test code, you will create a seperate list $**$ b$\_$list$**$ and fill in the b$\_$list with $24$ random values from range$(1,100),$ so the $24$ elements in b$\_$list is from $1$ to $99$ inclusive

# Print the b$\_$list before sorting

#Use the new version of quick$\_$sort $($pivot will be last element of list$)$ to sort the b$\_$list and print it out

b$\_$list$=$

print$($b$\_$list$)$

quick$\_$sort$($b$\_$list$)$

print$($b$\_$list$)$

# Task $3(50)$

# Based on the partition function, created another partition$\_$median, you will apply the algorithm

# Choose the pivot as the median of three on pg$.41-43$

# Create functions: quick$\_$sort$\_$median and quick$\_$sort$\_$median$\_$helper that call partition$\_$median inside

# Test your functions with random generated list, size $24$

c$\_$list$=$

print$($c$\_$list$)$

quick$\_$sort$\_$median$($c$\_$list$)$

print$($c$\_$list$)$