About stdlib...
We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.
The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.
When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.
To join us in bringing numerical computing to the web, get started by checking us out on GitHub, and please consider financially supporting stdlib. We greatly appreciate your continued support!
Sort a double-precision floating-point strided array using insertion sort.
npm install @stdlib/blas-ext-base-dsortinsAlternatively,
- To load the package in a website via a
scripttag without installation and bundlers, use the ES Module available on theesmbranch (see README). - If you are using Deno, visit the
denobranch (see README for usage intructions). - For use in Observable, or in browser/node environments, use the Universal Module Definition (UMD) build available on the
umdbranch (see README).
The branches.md file summarizes the available branches and displays a diagram illustrating their relationships.
To view installation and usage instructions specific to each branch build, be sure to explicitly navigate to the respective README files on each branch, as linked to above.
var dsortins = require( '@stdlib/blas-ext-base-dsortins' );Sorts a double-precision floating-point strided array using insertion sort.
var Float64Array = require( '@stdlib/array-float64' );
var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
dsortins( x.length, 1.0, x, 1 );
// x => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]The function has the following parameters:
- N: number of indexed elements.
- order: sort order. If
order < 0.0, the input strided array is sorted in decreasing order. Iforder > 0.0, the input strided array is sorted in increasing order. Iforder == 0.0, the input strided array is left unchanged. - x: input
Float64Array. - strideX: stride length.
The N and stride parameters determine which elements in the strided array are accessed at runtime. For example, to sort every other element:
var Float64Array = require( '@stdlib/array-float64' );
var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
dsortins( 2, -1.0, x, 2 );
// x => <Float64Array>[ 3.0, -2.0, 1.0, -4.0 ]Note that indexing is relative to the first index. To introduce an offset, use typed array views.
var Float64Array = require( '@stdlib/array-float64' );
// Initial array...
var x0 = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] );
// Create an offset view...
var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
// Sort every other element...
dsortins( 2, -1.0, x1, 2 );
// x0 => <Float64Array>[ 1.0, 4.0, 3.0, 2.0 ]Sorts a double-precision floating-point strided array using insertion sort and alternative indexing semantics.
var Float64Array = require( '@stdlib/array-float64' );
var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0 ] );
dsortins.ndarray( x.length, 1.0, x, 1, 0 );
// x => <Float64Array>[ -4.0, -2.0, 1.0, 3.0 ]The function has the following additional parameters:
- offsetX: starting index.
While typed array views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to access only the last three elements:
var Float64Array = require( '@stdlib/array-float64' );
var x = new Float64Array( [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ] );
dsortins.ndarray( 3, 1.0, x, 1, x.length-3 );
// x => <Float64Array>[ 1.0, -2.0, 3.0, -6.0, -4.0, 5.0 ]- If
N <= 0ororder == 0.0, both functions returnxunchanged. - The algorithm distinguishes between
-0and+0. When sorted in increasing order,-0is sorted before+0. When sorted in decreasing order,-0is sorted after+0. - The algorithm sorts
NaNvalues to the end. When sorted in increasing order,NaNvalues are sorted last. When sorted in decreasing order,NaNvalues are sorted first. - The algorithm has space complexity
O(1)and worst case time complexityO(N^2). - The algorithm is efficient for small strided arrays (typically
N <= 20) and is particularly efficient for sorting strided arrays which are already substantially sorted. - The algorithm is stable, meaning that the algorithm does not change the order of strided array elements which are equal or equivalent (e.g.,
NaNvalues). - The input strided array is sorted in-place (i.e., the input strided array is mutated).
var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
var dsortins = require( '@stdlib/blas-ext-base-dsortins' );
var x = discreteUniform( 10, -100, 100, {
'dtype': 'float64'
});
console.log( x );
dsortins( x.length, -1.0, x, -1 );
console.log( x );#include "stdlib/blas/ext/base/dsortins.h"Sorts a double-precision floating-point strided array using insertion sort.
double x[] = { 1.0, -2.0, 3.0, -4.0 };
stdlib_strided_dsortins( 2, -1.0, x, 1 );The function accepts the following arguments:
- N:
[in] CBLAS_INTnumber of indexed elements. - order:
[in] doublesort order. Iforder < 0.0, the input strided array is sorted in decreasing order. Iforder > 0.0, the input strided array is sorted in increasing order. Iforder == 0.0, the input strided array is left unchanged. - X:
[inout] double*input array. - strideX:
[in] CBLAS_INTstride length forX.
stdlib_strided_dsortins( const CBLAS_INT N, const double order, double *X, const CBLAS_INT strideX );Sorts a double-precision floating-point strided array using insertion sort and alternative indexing semantics.
double x[] = { 1.0, -2.0, 3.0, -4.0 };
stdlib_strided_dsortins_ndarray( 4, 1.0, x, 1, 0 );The function accepts the following arguments:
- N:
[in] CBLAS_INTnumber of indexed elements. - order:
[in] doublesort order. Iforder < 0.0, the input strided array is sorted in decreasing order. Iforder > 0.0, the input strided array is sorted in increasing order. Iforder == 0.0, the input strided array is left unchanged. - X:
[inout] double*input array. - strideX:
[in] CBLAS_INTstride length forX. - offsetX:
[in] CBLAS_INTstarting index forX.
stdlib_strided_dsortins_ndarray( const CBLAS_INT N, const double order, double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX );#include "stdlib/blas/ext/base/dsortins.h"
#include <stdio.h>
int main( void ) {
// Create a strided array:
double x[] = { 1.0, -2.0, 3.0, -4.0, 5.0, -6.0, 7.0, -8.0 };
// Specify the number of elements:
int N = 8;
// Specify a stride:
int strideX = 1;
// Sort the array:
stdlib_strided_dsortins( N, 1.0, x, strideX );
// Print the result:
for ( int i = 0; i < 8; i++ ) {
printf( "x[ %i ] = %lf\n", i, x[ i ] );
}
}@stdlib/blas-ext/base/dsort2ins: simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using insertion sort.@stdlib/blas-ext/base/gsortins: sort a strided array using insertion sort.@stdlib/blas-ext/base/ssortins: sort a single-precision floating-point strided array using insertion sort.
This package is part of stdlib, a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.
For more information on the project, filing bug reports and feature requests, and guidance on how to develop stdlib, see the main project repository.
See LICENSE.
Copyright © 2016-2025. The Stdlib Authors.