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 | 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 218x 218x 218x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 32x 32x 32x 32x 32x 32x 32x 32x 32x 32x 32x 147x 147x 32x 32x 32x 32x 32x 32x 21x 21x 21x 11x 11x 32x 1x 1x 1x 1x 1x | /**
* @license Apache-2.0
*
* Copyright (c) 2018 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 floor = require( '@stdlib/math/base/special/floor' );
// FUNCTIONS //
/**
* Comparator function used to sort values in ascending order.
*
* @private
* @param {number} a - first number
* @param {number} b - second number
* @returns {number} difference between `a` and `b`
*/
function ascending( a, b ) {
return a - b;
}
// MAIN //
/**
* Computes the median of an array.
*
* @param {Array} arr - input array
* @returns {number} median value
*/
function median( arr ) {
var len = arr.length;
var id;
var d;
var i;
if ( !len ) {
return null;
}
// Copy and sort data in ascending order:
d = [];
for ( i = 0; i < len; i++ ) {
d.push( arr[ i ] );
}
d.sort( ascending );
// Get the middle index:
id = floor( len / 2 );
if ( len % 2 ) {
// The number of elements is not evenly divisible by two, hence we have a middle index:
return d[ id ];
}
// Even number of elements, so must take the mean of the two middle values:
return ( d[ id-1 ] + d[ id ] ) / 2.0;
}
// EXPORTS //
module.exports = median;
|