You are viewing a single comment's thread. Return to all comments →
def paritition(arr,low,high): pivot = arr[high] i = low -1 for j in range(low,high): if arr[j]<= pivot: i=i+1 arr[i],arr[j]=arr[j],arr[i] arr[i+1],arr[high]=arr[high],arr[i+1] return i+1
def quick_sort(arr,low,high): if low
def countingSort(arr): # Write your code here quick_sort(arr,0,len(arr)-1) return arr****
Seems like cookies are disabled on this browser, please enable them to open this website
Counting Sort 2
You are viewing a single comment's thread. Return to all comments →
def paritition(arr,low,high): pivot = arr[high] i = low -1 for j in range(low,high): if arr[j]<= pivot: i=i+1 arr[i],arr[j]=arr[j],arr[i] arr[i+1],arr[high]=arr[high],arr[i+1] return i+1
def quick_sort(arr,low,high): if low
def countingSort(arr): # Write your code here quick_sort(arr,0,len(arr)-1) return arr****