Sort a double-precision floating-point strided array using insertion sort.
npm install @stdlib/blas-ext-base-dsortinsWe 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!
About stdlib...
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url]
> Sort a double-precision floating-point strided array using insertion sort.
``bash`
npm install @stdlib/blas-ext-base-dsortins
`javascript`
var dsortins = require( '@stdlib/blas-ext-base-dsortins' );
#### dsortins( N, order, x, strideX )
Sorts a double-precision floating-point strided array using insertion sort.
`javascript
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 =>
`
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. If order > 0.0, the input strided array is sorted in increasing order. If order == 0.0, the input strided array is left unchanged.Float64Array
- x: input [][@stdlib/array/float64].
- 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:
`javascript
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 =>
`
Note that indexing is relative to the first index. To introduce an offset, use [typed array][mdn-typed-array] views.
`javascript
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 =>
`
#### dsortins.ndarray( N, order, x, strideX, offsetX )
Sorts a double-precision floating-point strided array using insertion sort and alternative indexing semantics.
`javascript
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 =>
`
The function has the following additional parameters:
- offsetX: starting index.
While [typed array][mdn-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:
`javascript
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 =>
`
- If N <= 0 or order == 0.0, both functions return x unchanged.-0
- The algorithm distinguishes between and +0. When sorted in increasing order, -0 is sorted before +0. When sorted in decreasing order, -0 is sorted after +0.NaN
- The algorithm sorts values to the end. When sorted in increasing order, NaN values are sorted last. When sorted in decreasing order, NaN values are sorted first.O(1)
- The algorithm has space complexity and worst case time complexity O(N^2).N <= 20
- The algorithm is efficient for small strided arrays (typically ) and is particularly efficient for sorting strided arrays which are already substantially sorted.NaN
- The algorithm is stable, meaning that the algorithm does not change the order of strided array elements which are equal or equivalent (e.g., values).
- The input strided array is sorted in-place (i.e., the input strided array is mutated).
`javascript
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 );
`
*
`c`
#include "stdlib/blas/ext/base/dsortins.h"
#### stdlib_strided_dsortins( N, order, \*X, strideX )
Sorts a double-precision floating-point strided array using insertion sort.
`c
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_INT number of indexed elements.[in] double
- order: sort order. If order < 0.0, the input strided array is sorted in decreasing order. If order > 0.0, the input strided array is sorted in increasing order. If order == 0.0, the input strided array is left unchanged.[inout] double*
- X: input array.[in] CBLAS_INT
- strideX: stride length for X.
`c`
stdlib_strided_dsortins( const CBLAS_INT N, const double order, double *X, const CBLAS_INT strideX );
#### stdlib_strided_dsortins_ndarray( N, order, \*X, strideX, offsetX )
Sorts a double-precision floating-point strided array using insertion sort and alternative indexing semantics.
`c
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_INT number of indexed elements.[in] double
- order: sort order. If order < 0.0, the input strided array is sorted in decreasing order. If order > 0.0, the input strided array is sorted in increasing order. If order == 0.0, the input strided array is left unchanged.[inout] double*
- X: input array.[in] CBLAS_INT
- strideX: stride length for X.[in] CBLAS_INT
- offsetX: starting index for X.
`c`
stdlib_strided_dsortins_ndarray( const CBLAS_INT N, const double order, double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX );
`c
#include "stdlib/blas/ext/base/dsortins.h"
#include
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][@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][@stdlib/blas/ext/base/gsortins]: sort a strided array using insertion sort.
- [@stdlib/blas-ext/base/ssortins][@stdlib/blas/ext/base/ssortins]: sort a single-precision floating-point strided array using insertion sort.
*
This package is part of [stdlib][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][stdlib], see the main project [repository][stdlib].
#### Community
[![Chat][chat-image]][chat-url]
---
See [LICENSE][stdlib-license].
Copyright © 2016-2026. The Stdlib [Authors][stdlib-authors].
[npm-image]: http://img.shields.io/npm/v/@stdlib/blas-ext-base-dsortins.svg
[npm-url]: https://npmjs.org/package/@stdlib/blas-ext-base-dsortins
[test-image]: https://github.com/stdlib-js/blas-ext-base-dsortins/actions/workflows/test.yml/badge.svg?branch=v0.3.1
[test-url]: https://github.com/stdlib-js/blas-ext-base-dsortins/actions/workflows/test.yml?query=branch:v0.3.1
[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base-dsortins/main.svg
[coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base-dsortins?branch=main
[chat-image]: https://img.shields.io/badge/zulip-join_chat-brightgreen.svg
[chat-url]: https://stdlib.zulipchat.com
[stdlib]: https://github.com/stdlib-js/stdlib
[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
[umd]: https://github.com/umdjs/umd
[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
[deno-url]: https://github.com/stdlib-js/blas-ext-base-dsortins/tree/deno
[deno-readme]: https://github.com/stdlib-js/blas-ext-base-dsortins/blob/deno/README.md
[umd-url]: https://github.com/stdlib-js/blas-ext-base-dsortins/tree/umd
[umd-readme]: https://github.com/stdlib-js/blas-ext-base-dsortins/blob/umd/README.md
[esm-url]: https://github.com/stdlib-js/blas-ext-base-dsortins/tree/esm
[esm-readme]: https://github.com/stdlib-js/blas-ext-base-dsortins/blob/esm/README.md
[branches-url]: https://github.com/stdlib-js/blas-ext-base-dsortins/blob/main/branches.md
[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/blas-ext-base-dsortins/main/LICENSE
[@stdlib/array/float64]: https://www.npmjs.com/package/@stdlib/array-float64
[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray
[@stdlib/blas/ext/base/dsort2ins]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dsort2ins
[@stdlib/blas/ext/base/gsortins]: https://www.npmjs.com/package/@stdlib/blas-ext-base-gsortins
[@stdlib/blas/ext/base/ssortins]: https://www.npmjs.com/package/@stdlib/blas-ext-base-ssortins