mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 00:01:37 +08:00
Update AverageMedian.js and AverageMedian.test.js
This commit is contained in:
@ -8,9 +8,9 @@
|
||||
* else if the length of the array is odd number, the median value will be the middle number in the array
|
||||
*/
|
||||
|
||||
/*
|
||||
/*
|
||||
* Doctests
|
||||
*
|
||||
*
|
||||
* > averageMedian([8, 9, 1, 2, 5, 10, 11])
|
||||
* 8
|
||||
* > averageMedian([15, 18, 3, 9, 13, 5])
|
||||
@ -20,20 +20,20 @@
|
||||
*/
|
||||
|
||||
const averageMedian = (numbers) => {
|
||||
let median = 0, numLength = numbers.length
|
||||
numbers = numbers.sort(sortNumbers)
|
||||
|
||||
if (numLength % 2 === 0) {
|
||||
median = (numbers[numLength / 2 - 1] + numbers[numLength / 2]) / 2
|
||||
} else {
|
||||
median = numbers[(numLength - 1) / 2]
|
||||
}
|
||||
|
||||
return median
|
||||
let median = 0; const numLength = numbers.length
|
||||
numbers = numbers.sort(sortNumbers)
|
||||
|
||||
if (numLength % 2 === 0) {
|
||||
median = (numbers[numLength / 2 - 1] + numbers[numLength / 2]) / 2
|
||||
} else {
|
||||
median = numbers[(numLength - 1) / 2]
|
||||
}
|
||||
|
||||
return median
|
||||
}
|
||||
|
||||
const sortNumbers = (num1, num2) => {
|
||||
return num1 - num2
|
||||
return num1 - num2
|
||||
}
|
||||
|
||||
export { averageMedian }
|
||||
export { averageMedian }
|
||||
|
@ -16,6 +16,6 @@ test('should return the median of an array of numbers:', () => {
|
||||
})
|
||||
|
||||
test('should return the median of an array of numbers:', () => {
|
||||
const medianValue = averageMedian([1,2,3,4,6,8])
|
||||
const medianValue = averageMedian([1, 2, 3, 4, 6, 8])
|
||||
expect(medianValue).toBe(3.5)
|
||||
})
|
||||
})
|
||||
|
Reference in New Issue
Block a user