Function partition

tests/test_parser/test_sample/py_test_sample.py:1–35

Function to find the partition position :param array: the unsorted array :type array: List :param low: smaller pivot :type low: int :param high: greater pivot :type high: int

(array, low, high)

def partition(array, low, high):
    """
    Function to find the partition position
    
    :param array: the unsorted array
    :type array: List
    :param low: smaller pivot
    :type low: int
    :param high: greater pivot
    :type high: int
    
    """
    # choose the rightmost element as pivot
    pivot = array[high]
 
    # pointer for greater element
    i = low - 1
 
    # traverse through all elements
    # compare each element with pivot
    for j in range(low, high):
        if array[j] <= pivot:
 
            # If element smaller than pivot is found
            # swap it with the greater element pointed by i
            i = i + 1
 
            # Swapping element at i with element at j
            (array[i], array[j]) = (array[j], array[i])
 
    # Swap the pivot element with the greater element specified by i
    (array[i + 1], array[high]) = (array[high], array[i + 1])
 
    # Return the position from where partition is done
    return i + 1

def quickSort(array, low, high):
    """