Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 | 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 33x 33x 33x 33x 33x 33x 33x 33x 33x 33x 33x 17x 17x 33x 4x 4x 29x 33x 14x 14x 14x 33x 120x 120x 67x 67x 67x 67x 110x 110x 48x 48x 62x 62x 67x 67x 120x 15x 33x 3x 3x 3x 3x 3x | /**
* @license Apache-2.0
*
* Copyright (c) 2026 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
'use strict';
// MODULES //
var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var GAPS = require( './gaps.json' );
var accessors = require( './accessors.js' );
// VARIABLES //
var NGAPS = GAPS.length;
// MAIN //
/**
* Sorts a strided array using Shellsort according to a provided callback function and using alternative indexing semantics.
*
* ## Notes
*
* - This implementation uses the gap sequence proposed by Ciura (2001).
*
* ## References
*
* - Shell, Donald L. 1959. "A High-Speed Sorting Procedure." _Communications of the ACM_ 2 (7). Association for Computing Machinery: 30–32. doi:[10.1145/368370.368387](https://doi.org/10.1145/368370.368387).
* - Ciura, Marcin. 2001. "Best Increments for the Average Case of Shellsort." In _Fundamentals of Computation Theory_, 106–17. Springer Berlin Heidelberg. doi:[10.1007/3-540-44669-9\_12](https://doi.org/10.1007/3-540-44669-9_12).
*
* @param {PositiveInteger} N - number of indexed elements
* @param {Collection} x - input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @param {Callback} clbk - callback function
* @param {*} [thisArg] - execution context
* @returns {Collection} input array
*
* @example
* var x = [ 1.0, -2.0, 3.0, -4.0 ];
*
* function clbk( a, b ) {
* if ( a < b ) {
* return -1;
* }
* if ( a > b ) {
* return 1;
* }
* return 0;
* }
*
* gsortshBy( x.length, x, 1, 0, clbk );
* // x => [ -4.0, -2.0, 1.0, 3.0 ]
*/
function gsortshBy( N, x, strideX, offsetX, clbk ) {
var thisArg;
var gap;
var ox;
var v;
var u;
var i;
var j;
var k;
if ( arguments.length > 5 ) {
thisArg = arguments[ 5 ];
}
if ( N <= 0 ) {
return x;
}
ox = arraylike2object( x );
if ( ox.accessorProtocol ) {
accessors( N, ox, strideX, offsetX, clbk, thisArg );
return x;
}
for ( i = 0; i < NGAPS; i++ ) {
gap = GAPS[ i ];
for ( j = gap; j < N; j++ ) {
v = x[ offsetX+(j*strideX) ];
// Perform insertion sort on the "gapped" subarray...
for ( k = j; k >= gap; k -= gap ) {
u = x[ offsetX+((k-gap)*strideX) ];
if ( clbk.call( thisArg, u, v, x ) <= 0 ) {
break;
}
x[ offsetX+(k*strideX) ] = u;
}
x[ offsetX+(k*strideX) ] = v;
}
}
return x;
}
// EXPORTS //
module.exports = gsortshBy;
|