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 116 117 118 | 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 3x 3x 3x 3x 3x 3x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 14x 112x 112x 65x 65x 65x 65x 107x 107x 48x 48x 59x 59x 65x 65x 112x 14x 14x 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 GAPS = require( './gaps.json' );
// VARIABLES //
var NGAPS = GAPS.length;
// MAIN //
/**
* Sorts a strided array using Shellsort according to a provided callback function.
*
* ## 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).
*
* @private
* @param {PositiveInteger} N - number of indexed elements
* @param {Object} x - input array object
* @param {Collection} x.data - input array data
* @param {Array<Function>} x.accessors - array element accessors
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @param {Callback} clbk - callback function
* @param {*} [thisArg] - execution context
* @returns {Object} `x`
*
* @example
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' );
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
*
* 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, arraylike2object( toAccessorArray( x ) ), 1, 0, clbk );
*
* console.log( x );
* // => [ -4.0, -2.0, 1.0, 3.0 ]
*/
function gsortshBy( N, x, strideX, offsetX, clbk, thisArg ) {
var xbuf;
var xget;
var xset;
var gap;
var v;
var u;
var i;
var j;
var k;
// Cache reference to array data:
xbuf = x.data;
// Cache references to element accessors:
xget = x.accessors[ 0 ];
xset = x.accessors[ 1 ];
for ( i = 0; i < NGAPS; i++ ) {
gap = GAPS[ i ];
for ( j = gap; j < N; j++ ) {
v = xget( xbuf, offsetX+(j*strideX) );
// Perform insertion sort on the "gapped" subarray...
for ( k = j; k >= gap; k -= gap ) {
u = xget( xbuf, offsetX+((k-gap)*strideX) );
if ( clbk.call( thisArg, u, v, x ) <= 0 ) {
break;
}
xset( xbuf, offsetX+(k*strideX), u );
}
xset( xbuf, offsetX+(k*strideX), v );
}
}
return x;
}
// EXPORTS //
module.exports = gsortshBy;
|