ak.argsort ---------- .. py:module: ak.argsort Defined in `awkward.operations.ak_argsort `__ on `line 18 `__. .. py:function:: ak.argsort(array, axis=-1, *, ascending=True, stable=True, highlevel=True, behavior=None, attrs=None) :param array: Array-like data (anything :py:obj:`ak.to_layout` recognizes). :param axis: The dimension at which this operation is applied. The outermost dimension is ``0``, followed by ``1``, etc., and negative values count backward from the innermost: ``-1`` is the innermost dimension, ``-2`` is the next level up, etc. :type axis: int :param ascending: If True, the first value in each sorted group will be smallest, the last value largest; if False, the order is from largest to smallest. :type ascending: bool :param stable: If True, use a stable sorting algorithm; if False, use a sorting algorithm that is not guaranteed to be stable. :type stable: bool :param highlevel: If True, return an :py:obj:`ak.Array`; otherwise, return a low-level :py:obj:`ak.contents.Content` subclass. :type highlevel: bool :param behavior: Custom :py:obj:`ak.behavior` for the output array, if high-level. :type behavior: None or dict :param attrs: Custom attributes for the output array, if high-level. :type attrs: None or dict Returns an array of integer indexes that would sort the array if applied as an integer-array slice. For example, .. code-block:: python >>> ak.argsort(ak.Array([[7.7, 5.5, 7.7], [], [2.2], [8.8, 2.2]])) The result of this function can be used to index other arrays with the same shape: .. code-block:: python >>> data = ak.Array([[7, 5, 7], [], [2], [8, 2]]) >>> index = ak.argsort(data) >>> index >>> data[index]