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 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x | /**
* @license Apache-2.0
*
* Copyright (c) 2025 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';
// MAIN //
/**
* Simultaneously sorts two arrays based on the sort order of the first array using insertion sort.
*
* ## Notes
*
* - The first array is sorted in increasing order according to absolute value.
* - The algorithm has space complexity `O(1)` and worst case time complexity `O(N^2)`.
* - The algorithm is efficient for small arrays (typically `N <= 20`) and is particularly efficient for sorting arrays which are already substantially sorted.
* - The algorithm is **stable**, meaning that the algorithm does **not** change the order of array elements which are equal or equivalent.
* - The input arrays are sorted in-place (i.e., the input arrays are mutated).
*
* @private
* @param {Array} x - first array
* @param {Array} y - second array
* @returns {void}
*
* @example
* var x = [ -4, -2, 3, 1 ];
* var y = [ 0, 1, 2, 3 ];
*
* sort2ins( x, y );
*
* console.log( x );
* // => [ 1, -2, 3, -4 ]
*
* console.log( y );
* // => [ 3, 1, 2, 0 ]
*/
function sort2ins( x, y ) {
var avx;
var aux;
var ix;
var iy;
var jx;
var jy;
var vx;
var vy;
var ux;
var i;
ix = 1;
iy = 1;
// Sort in increasing order...
for ( i = 1; i < x.length; i++ ) {
vx = x[ ix ];
avx = ( vx < 0 ) ? -vx : vx;
vy = y[ iy ];
jx = ix - 1;
jy = iy - 1;
// Shift all larger values to the left of the current element to the right...
while ( jx >= 0 ) {
ux = x[ jx ];
aux = ( ux < 0 ) ? -ux : ux;
if ( aux <= avx ) {
break;
}
x[ jx+1 ] = ux;
y[ jy+1 ] = y[ jy ];
jx -= 1;
jy -= 1;
}
x[ jx+1 ] = vx;
y[ jy+1 ] = vy;
ix += 1;
iy += 1;
}
}
// EXPORTS //
module.exports = sort2ins;
|