Demo entry 6783740

lkjlkjl

   

Submitted by anonymous on Feb 20, 2019 at 00:53
Language: Python 3. Code size: 1.2 kB.

def partition(arr,low,high): 
    i = ( low-1 )         # index of smaller element 
    pivot = arr[high]     # pivot 
    
    for j in range(low , high): 

  
        # If current element is smaller than or 
        # equal to pivot 
        if   arr[j] <= pivot: 
          
            # increment index of smaller element 
            i = i+1 
            arr[i],arr[j] = arr[j],arr[i] 

    arr[i+1],arr[high] = arr[high],arr[i+1] 
    print("returning: " + str(arr[i +1]))
    return ( i+1 ) 
  
# The main function that implements QuickSort 
# arr[] --> Array to be sorted, 
# low  --> Starting index, 
# high  --> Ending index 
  
# Function to do Quick sort 
def quickSort(arr,low,high):
	print(arr)

	if low < high:

  
        # pi is partitioning index, arr[p] is now 
        # at right place 
		pi = partition(arr,low,high)
  
        # Separately sort elements before 
        # partition and after partition 
        
		quickSort(arr, pi+1, high)
		quickSort(arr, low, pi-1) 
# Driver code to test above 
arr = [6,10, 7, 11, 9, 1, 5] 
n = len(arr) 
quickSort(arr,0,n-1) 
print ("Sorted array is:") 
for i in range(n): 
    print ("%d" %arr[i]), 

This snippet took 0.00 seconds to highlight.

Back to the Entry List or Home.

Delete this entry (admin only).