Sorting

function sort(a: ArrayLike, axis?: number): NDArray

import * as np from 'numpy-ts';

const a = np.array([3, 1, 4, 1, 5, 9]);
const sorted = np.sort(a);
// array([1, 1, 3, 4, 5, 9])

// Sort along axis 0 (columns)
const b = np.array([[3, 1], [2, 4]]);
np.sort(b, 0);
// array([[2, 1],
//        [3, 4]])

// Sort along axis 1 (rows) -- default
np.sort(b);
// array([[1, 3],
//        [2, 4]])

function argsort(a: ArrayLike, axis?: number): NDArray

import * as np from 'numpy-ts';

const a = np.array([30, 10, 40, 20]);
const indices = np.argsort(a);
// array([1, 3, 0, 2])

// Verify: reconstruct sorted array using the indices
// a[indices] -> [10, 20, 30, 40]

function lexsort(keys: ArrayLike[]): NDArray

import * as np from 'numpy-ts';

// Sort by last name (primary), then first name (secondary)
const first = [1, 2, 1, 2];   // secondary key
const last  = [10, 10, 20, 20]; // primary key

const indices = np.lexsort([first, last]);
// array([0, 1, 2, 3])
// Sorted: (10,1), (10,2), (20,1), (20,2)

function partition(a: ArrayLike, kth: number, axis?: number): NDArray

import * as np from 'numpy-ts';

const a = np.array([3, 1, 4, 1, 5, 9, 2, 6]);
const p = np.partition(a, 3);
// The element at index 3 is the 4th smallest (2).
// Elements at indices 0-2 are <= 2, elements at indices 4-7 are >= 2.
console.log(p.item(3)); // 2

function argpartition(a: ArrayLike, kth: number, axis?: number): NDArray

import * as np from 'numpy-ts';

const a = np.array([3, 1, 4, 1, 5]);
const indices = np.argpartition(a, 2);
// indices[2] points to the element that would be at position 2 in a sorted array

function sort_complex(a: ArrayLike): NDArray

import * as np from 'numpy-ts';

const a = np.array([3, 1, 2]);
const result = np.sort_complex(a);
// array([1+0j, 2+0j, 3+0j])

// For real inputs, behaves like sort but returns complex dtype