@stdlib/blas-ext-base-gsort2hp

<details> <summary> About stdlib... </summary> <p>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.</p> <p>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.</p> <p>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.</p> <p>To join us in bringing numerical computing to the web, get started by checking us out on <a href="https://github.com/stdlib-js/stdlib">GitHub</a>, and please consider <a href="https://opencollective.com/stdlib">financially supporting stdlib</a>. We greatly appreciate your continued support!</p> </details> # gsort2hp [![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url]  > Simultaneously sort two strided arrays based on the sort order of the first array using heapsort. <section class="installation"> ## Installation ```bash npm install @stdlib/blas-ext-base-gsort2hp ``` </section> <section class="usage"> ## Usage ```javascript var gsort2hp = require( '@stdlib/blas-ext-base-gsort2hp' ); ``` #### gsort2hp( N, order, x, strideX, y, strideY ) Simultaneously sorts two strided arrays based on the sort order of the first array using heapsort. ```javascript var x = [ 1.0, -2.0, 3.0, -4.0 ]; var y = [ 0.0, 1.0, 2.0, 3.0 ]; gsort2hp( x.length, 1.0, x, 1, y, 1 ); console.log( x ); // => [ -4.0, -2.0, 1.0, 3.0 ] console.log( y ); // => [ 3.0, 1.0, 0.0, 2.0 ] ``` The function has the following parameters: - **N**: number of indexed elements. - **order**: sort order. If `order < 0.0`, the input strided array `x` is sorted in **decreasing** order. If `order > 0.0`, the input strided array `x` is sorted in **increasing** order. If `order == 0.0`, the input strided arrays are left unchanged. - **x**: first input [`Array`][mdn-array] or [`typed array`][mdn-typed-array]. - **strideX**: stride length for `x`. - **y**: second input [`Array`][mdn-array] or [`typed array`][mdn-typed-array]. - **strideY**: stride length for `y`. The `N` and stride parameters determine which elements in the strided arrays are accessed at runtime. For example, to sort every other element: ```javascript var x = [ 1.0, -2.0, 3.0, -4.0 ]; var y = [ 0.0, 1.0, 2.0, 3.0 ]; gsort2hp( 2, -1.0, x, 2, y, 2 ); console.log( x ); // => [ 3.0, -2.0, 1.0, -4.0 ] console.log( y ); // => [ 2.0, 1.0, 0.0, 3.0 ] ``` 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 arrays... var x0 = new Float64Array( [ 1.0, 2.0, 3.0, 4.0 ] ); var y0 = new Float64Array( [ 0.0, 1.0, 2.0, 3.0 ] ); // Create offset views... var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element var y1 = new Float64Array( y0.buffer, y0.BYTES_PER_ELEMENT*1 ); // start at 2nd element // Sort every other element... gsort2hp( 2, -1.0, x1, 2, y1, 2 ); console.log( x0 ); // => <Float64Array>[ 1.0, 4.0, 3.0, 2.0 ] console.log( y0 ); // => <Float64Array>[ 0.0, 3.0, 2.0, 1.0 ] ``` #### gsort2hp.ndarray( N, order, x, strideX, offsetX, y, strideY, offsetY ) Simultaneously sorts two strided arrays based on the sort order of the first array using heapsort and alternative indexing semantics. ```javascript var x = [ 1.0, -2.0, 3.0, -4.0 ]; var y = [ 0.0, 1.0, 2.0, 3.0 ]; gsort2hp.ndarray( x.length, 1.0, x, 1, 0, y, 1, 0 ); console.log( x ); // => [ -4.0, -2.0, 1.0, 3.0 ] console.log( y ); // => [ 3.0, 1.0, 0.0, 2.0 ] ``` The function has the following additional parameters: - **offsetX**: starting index for `x`. - **offsetY**: starting index for `y`. While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameters support indexing semantics based on starting indices. For example, to access only the last three elements: ```javascript var x = [ 1.0, -2.0, 3.0, -4.0, 5.0, -6.0 ]; var y = [ 0.0, 1.0, 2.0, 3.0, 4.0, 5.0 ]; gsort2hp.ndarray( 3, 1.0, x, 1, x.length-3, y, 1, y.length-3 ); console.log( x ); // => [ 1.0, -2.0, 3.0, -6.0, -4.0, 5.0 ] console.log( y ); // => [ 0.0, 1.0, 2.0, 5.0, 3.0, 4.0 ] ``` </section>  <section class="notes"> ## Notes - If `N <= 0` or `order == 0.0`, both functions leave `x` and `y` unchanged. - Both functions support array-like objects having getter and setter accessors for array element access (e.g., [`@stdlib/array-base/accessor`][@stdlib/array/base/accessor]). - The algorithm distinguishes between `-0` and `+0`. When sorted in increasing order, `-0` is sorted before `+0`. When sorted in decreasing order, `-0` is sorted after `+0`. - The algorithm sorts `NaN` values to the end. When sorted in increasing order, `NaN` values are sorted last. When sorted in decreasing order, `NaN` values are sorted first. - The algorithm has space complexity `O(1)` and worst case time complexity `O(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 has space complexity `O(1)` and time complexity `O(N log2 N)`. - The algorithm is **unstable**, meaning that the algorithm may change the order of strided array elements which are equal or equivalent (e.g., `NaN` values). - Depending on the environment, the typed versions ([`dsort2hp`][@stdlib/blas/ext/base/dsort2hp], [`ssort2hp`][@stdlib/blas/ext/base/ssort2hp], etc.) are likely to be significantly more performant. </section>  <section class="examples"> ## Examples  ```javascript var discreteUniform = require( '@stdlib/random-array-discrete-uniform' ); var gsort2hp = require( '@stdlib/blas-ext-base-gsort2hp' ); var x = discreteUniform( 10, -100, 100, { 'dtype': 'float64' }); var y = discreteUniform( 10, -100, 100, { 'dtype': 'float64' }); console.log( x ); console.log( y ); gsort2hp( x.length, -1.0, x, -1, y, -1 ); console.log( x ); console.log( y ); ``` </section>  * * * <section class="references"> ## References - Williams, John William Joseph. 1964. "Algorithm 232: Heapsort." _Communications of the ACM_ 7 (6). New York, NY, USA: Association for Computing Machinery: 347–49. doi:[10.1145/512274.512284][@williams:1964a]. - Floyd, Robert W. 1964. "Algorithm 245: Treesort." _Communications of the ACM_ 7 (12). New York, NY, USA: Association for Computing Machinery: 701. doi:[10.1145/355588.365103][@floyd:1964a]. </section> <section class="main-repo" > * * * ## Notice 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] --- ## License See [LICENSE][stdlib-license]. ## Copyright Copyright © 2016-2026. The Stdlib [Authors][stdlib-authors]. </section>   <section class="links"> [npm-image]: http://img.shields.io/npm/v/@stdlib/blas-ext-base-gsort2hp.svg [npm-url]: https://npmjs.org/package/@stdlib/blas-ext-base-gsort2hp [test-image]: https://github.com/stdlib-js/blas-ext-base-gsort2hp/actions/workflows/test.yml/badge.svg?branch=v0.3.1 [test-url]: https://github.com/stdlib-js/blas-ext-base-gsort2hp/actions/workflows/test.yml?query=branch:v0.3.1 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base-gsort2hp/main.svg [coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base-gsort2hp?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-gsort2hp/tree/deno [deno-readme]: https://github.com/stdlib-js/blas-ext-base-gsort2hp/blob/deno/README.md [umd-url]: https://github.com/stdlib-js/blas-ext-base-gsort2hp/tree/umd [umd-readme]: https://github.com/stdlib-js/blas-ext-base-gsort2hp/blob/umd/README.md [esm-url]: https://github.com/stdlib-js/blas-ext-base-gsort2hp/tree/esm [esm-readme]: https://github.com/stdlib-js/blas-ext-base-gsort2hp/blob/esm/README.md [branches-url]: https://github.com/stdlib-js/blas-ext-base-gsort2hp/blob/main/branches.md [stdlib-license]: https://raw.githubusercontent.com/stdlib-js/blas-ext-base-gsort2hp/main/LICENSE [mdn-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array [mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray [@stdlib/array/base/accessor]: https://www.npmjs.com/package/@stdlib/array-base-accessor [@stdlib/blas/ext/base/dsort2hp]: https://www.npmjs.com/package/@stdlib/blas-ext-base-dsort2hp [@stdlib/blas/ext/base/ssort2hp]: https://www.npmjs.com/package/@stdlib/blas-ext-base-ssort2hp [@williams:1964a]: https://doi.org/10.1145/512274.512284 [@floyd:1964a]: https://doi.org/10.1145/355588.365103 </section>