algorithmpool
Version:
A pool of algorithms and data-structures for geeks
29 lines (28 loc) • 774 B
JavaScript
import {
defaultCompare,
Compare
} from '../../utils/util';
export function findMaxValue(array, compareFn = defaultCompare) {
if (array && array.length > 0) {
let max = array[0];
for (let i = 1; i < array.length; i++) {
if (compareFn(max, array[i]) === Compare.LESS_THAN) {
max = array[i];
}
}
return max;
}
return undefined;
}
export function findMinValue(array, compareFn = defaultCompare) {
if (array && array.length > 0) {
let min = array[0];
for (let i = 1; i < array.length; i++) {
if (compareFn(min, array[i]) === Compare.BIGGER_THAN) {
min = array[i];
}
}
return min;
}
return undefined;
}