time-to-botec

Benchmark sampling in different programming languages
Log | Files | Refs | README

ndarray.js (1605B)


      1 /**
      2 * @license Apache-2.0
      3 *
      4 * Copyright (c) 2020 The Stdlib Authors.
      5 *
      6 * Licensed under the Apache License, Version 2.0 (the "License");
      7 * you may not use this file except in compliance with the License.
      8 * You may obtain a copy of the License at
      9 *
     10 *    http://www.apache.org/licenses/LICENSE-2.0
     11 *
     12 * Unless required by applicable law or agreed to in writing, software
     13 * distributed under the License is distributed on an "AS IS" BASIS,
     14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
     15 * See the License for the specific language governing permissions and
     16 * limitations under the License.
     17 */
     18 
     19 'use strict';
     20 
     21 // MODULES //
     22 
     23 var floor = require( '@stdlib/math/base/special/floor' );
     24 
     25 
     26 // MAIN //
     27 
     28 /**
     29 * Computes the median value of a sorted strided array.
     30 *
     31 * @param {PositiveInteger} N - number of indexed elements
     32 * @param {NumericArray} x - sorted input array
     33 * @param {integer} stride - stride length
     34 * @param {NonNegativeInteger} offset - starting index
     35 * @returns {number} median value
     36 *
     37 * @example
     38 * var floor = require( '@stdlib/math/base/special/floor' );
     39 *
     40 * var x = [ 2.0, -3.0, 2.0, -2.0, -2.0, 2.0, 3.0, 4.0 ];
     41 * var N = floor( x.length / 2 );
     42 *
     43 * var v = mediansorted( N, x, 2, 1 );
     44 * // returns 0.0
     45 */
     46 function mediansorted( N, x, stride, offset ) {
     47 	var n;
     48 	var m;
     49 
     50 	if ( N <= 0 ) {
     51 		return NaN;
     52 	}
     53 	n = N / 2;
     54 	m = floor( n );
     55 	if ( n === m ) {
     56 		// Even number of elements...
     57 		return ( x[ offset+(m*stride) ] + x[ offset+((m-1)*stride) ] ) / 2.0;
     58 	}
     59 	// Odd number of elements...
     60 	return x[ offset+(m*stride) ];
     61 }
     62 
     63 
     64 // EXPORTS //
     65 
     66 module.exports = mediansorted;