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 | 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 22x 22x 22x 22x 22x 22x 22x 22x 22x 22x 22x 3x 3x 19x 22x 9x 9x 22x 9x 22x 10x 10x 22x 152x 152x 2481x 2481x 2481x 2481x 209x 209x 2272x 2272x 2481x 7414x 7414x 1615x 1615x 5799x 5799x 2272x 2272x 152x 19x 22x 2x 2x 2x 2x 2x | /**
* @license Apache-2.0
*
* Copyright (c) 2020 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 isNegativeZerof = require( '@stdlib/math/base/assert/is-negative-zerof' );
var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
var GAPS = require( './gaps.json' );
// VARIABLES //
var NGAPS = GAPS.length;
// MAIN //
/**
* Sorts a single-precision floating-point strided array using Shellsort.
*
* ## 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 {number} order - sort order
* @param {Float32Array} x - input array
* @param {integer} stride - index increment
* @returns {Float32Array} input array
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
*
* var x = new Float32Array( [ 1.0, -2.0, 3.0, -4.0 ] );
*
* ssortsh( x.length, 1.0, x, 1 );
* // x => <Float32Array>[ -4.0, -2.0, 1.0, 3.0 ]
*/
function ssortsh( N, order, x, stride ) {
var offset;
var flg;
var gap;
var v;
var u;
var i;
var j;
var k;
if ( N <= 0 || order === 0.0 ) {
return x;
}
// For a positive stride, sorting in decreasing order is equivalent to providing a negative stride and sorting in increasing order, and, for a negative stride, sorting in decreasing order is equivalent to providing a positive stride and sorting in increasing order...
if ( order < 0.0 ) {
stride *= -1;
}
if ( stride < 0 ) {
offset = (1-N) * stride;
} else {
offset = 0;
}
for ( i = 0; i < NGAPS; i++ ) {
gap = GAPS[ i ];
for ( j = gap; j < N; j++ ) {
v = x[ offset+(j*stride) ];
// If `NaN`, the current value is already sorted to its place...
if ( isnanf( v ) ) {
continue;
}
// Perform insertion sort on the "gapped" subarray...
flg = isNegativeZerof( v );
for ( k = j; k >= gap; k -= gap ) {
u = x[ offset+((k-gap)*stride) ];
if ( u <= v && !(flg && u === v) ) {
break;
}
x[ offset+(k*stride) ] = u;
}
x[ offset+(k*stride) ] = v;
}
}
return x;
}
// EXPORTS //
module.exports = ssortsh;
|