Sorting, searching, and counting#
Sorting#
|
Returns a sorted copy of an array with a stable sorting algorithm. |
|
Perform an indirect sort using an array of keys. |
|
Returns the indices that would sort an array with a stable sorting. |
|
Returns a copy of an array sorted along the first axis. |
|
Sort a complex array using the real part first, then the imaginary part. |
|
Returns a partitioned copy of an array. |
|
Returns the indices that would partially sort an array. |
See also
Searching#
|
Returns the indices of the maximum along an axis. |
|
Return the indices of the maximum values in the specified axis ignoring NaNs. |
|
Returns the indices of the minimum along an axis. |
|
Return the indices of the minimum values in the specified axis ignoring NaNs. |
|
Return the indices of the elements that are non-zero. |
|
Return the indices of the elements that are non-zero. |
|
Return indices that are non-zero in the flattened version of a. |
|
Return elements, either from x or y, depending on condition. |
|
Finds indices where elements should be inserted to maintain order. |
|
Return the elements of an array that satisfy some condition. |
Counting#
|
Counts the number of non-zero values in the array. |