deftest_quicksort():# algorithm taken from Wikipediadefswap(arr,i,j):t=arr[i]arr[i]=arr[j]arr[j]=tdefpartition(arr,idx_low,idx_high):pivot=arr[idx_high]i=idx_lowforjinrange(idx_low,idx_high):ifarr[j]<pivot:swap(arr,i,j)i+=1swap(arr,i,idx_high)returnidefquicksort(arr,start,end):ifstart<end:p=partition(arr,start,end)quicksort(arr,start,p-1)quicksort(arr,p+1,end)