(a, axis=-1, kind=None, order=None, ascending=True)
Returns the indices that would sort an array.

    Perform an indirect sort along the given axis using the algorithm specified
    by the `kind` keyword. It returns an array of indices of the same shape as
    `a` that index data along the given axis in sorted order.

    Parameters
    ----------
    a : :obj:`Array`
        Array to sort.
    axis: Unsupported
    kind: {'quicksort', 'mergesort'}, optional
        Sorting algorithm. Default is 'quicksort'.
        In fact sorting algorithm is never niether 'quicksort' nor 'mergesort'.
        It is just either nonstable or stable sort.
    order: Unsupported

    Returns
    -------
    index_array : ndarray, int
        Array of indices that sort `a`.
Returns the indices that would sort an array.
Returns the indices that would sort an array .
def argsort(a, axis=-1, kind=None, order=None, ascending=True):
    """
    Returns the indices that would sort an array.

    Perform an indirect sort along the given axis using the algorithm specified
    by the `kind` keyword. It returns an array of indices of the same shape as
    `a` that index data along the given axis in sorted order.

    Parameters
    ----------
    a : :obj:`Array`
        Array to sort.
    axis: Unsupported
    kind: {'quicksort', 'mergesort'}, optional
        Sorting algorithm. Default is 'quicksort'.
        In fact sorting algorithm is never niether 'quicksort' nor 'mergesort'.
        It is just either nonstable or stable sort.
    order: Unsupported

    Returns
    -------
    index_array : ndarray, int
        Array of indices that sort `a`.
    """

    pass
def argsort ( a , axis = - 1 , kind = None , order = None , ascending = True ) : pass