# https://www.geeksforgeeks.org/python-program-for-quicksort/
# GeekforGeeks allows copy-paste of their code as long as proper attribution is given to them.
# To be clear, this entire file was written by members/contributors of the geeksforgeeks team and this repo holds no ownership of this code.

# Python program for implementation of Quicksort Sort
 
# This function takes last element as pivot, places
# the pivot element at its correct position in sorted
# array, and places all smaller (smaller than pivot)
# to left of pivot and all greater elements to right
# of pivot
 
 
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]
    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):
    if len(arr) == 1:
        return 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, low, pi-1)
        quickSort(arr, pi+1, high)
 
# This code is contributed by <NAME>
#This code in improved by https://github.com/anushkrishnav 
# https://www.geeksforgeeks.org/python-program-for-quicksort/
# GeekforGeeks allows copy-paste of their code as long as proper attribution is given to them.
# To be clear, this entire file was written by members/contributors of the geeksforgeeks team and this repo holds no ownership of this code.

# Python program for implementation of Quicksort Sort
 
# This function takes last element as pivot, places
# the pivot element at its correct position in sorted
# array, and places all smaller (smaller than pivot)
# to left of pivot and all greater elements to right
# of pivot
 
 
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]
    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):
    if len(arr) == 1:
        return 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, low, pi-1)
        quickSort(arr, pi+1, high)
 
# This code is contributed by <NAME>
#This code in improved by https://github.com/anushkrishnav 
# https://www.geeksforgeeks.org/python-program-for-quicksort/ # GeekforGeeks allows copy-paste of their code as long as proper attribution is given to them. # To be clear, this entire file was written by members/contributors of the geeksforgeeks team and this repo holds no ownership of this code. # Python program for implementation of Quicksort Sort # This function takes last element as pivot, places # the pivot element at its correct position in sorted # array, and places all smaller (smaller than pivot) # to left of pivot and all greater elements to right # of pivot # index of smaller element # pivot # If current element is smaller than or # equal to pivot # increment index of smaller element # The main function that implements QuickSort # arr[] --> Array to be sorted, # low  --> Starting index, # high  --> Ending index # Function to do Quick sort # pi is partitioning index, arr[p] is now # at right place # Separately sort elements before # partition and after partition # This code is contributed by <NAME> #This code in improved by https://github.com/anushkrishnav