(a) Write code to implement the Quicksort algorithm. Your code should print both the input and...

 

Transcribed Image Text:

(a) Write code to implement the Quicksort algorithm. Your code should print both the input and output arrays to the screen. (b) Using the list LArray = {26, 14, 52, 7, 15, 37, 91, 2, 28, 73} illustrate how quicksort works. (c) Using the list LArray = {37, 91, 2, 26, 14, 52, 7, 28, 15, 73} illustrate how quicksort works ALGORITHM Quicksort(A[l..r]) //Sorts a subarray by quicksort //Input: Subarray of array A[0..n-1], defined by its left and right indices 1 and r // //Output: Subarray A[l..r] sorted in nondecreasing order if l<r s ←Partition (A[l..r]) //s is a split position Quicksort(A[l..s -1]) Quicksort (A[s+ 1..r]) (a) Write code to implement the Quicksort algorithm. Your code should print both the input and output arrays to the screen. (b) Using the list LArray = {26, 14, 52, 7, 15, 37, 91, 2, 28, 73} illustrate how quicksort works. (c) Using the list LArray = {37, 91, 2, 26, 14, 52, 7, 28, 15, 73} illustrate how quicksort works ALGORITHM Quicksort(A[l..r]) //Sorts a subarray by quicksort //Input: Subarray of array A[0..n-1], defined by its left and right indices 1 and r // //Output: Subarray A[l..r] sorted in nondecreasing order if l<r s ←Partition (A[l..r]) //s is a split position Quicksort(A[l..s -1]) Quicksort (A[s+ 1..r])

Answer rating: 100% (QA)

Code python def quicksortarr if lenarr pivot return quicksortleft middle quicksortright Part b Illus... View the full answer