Toggle navigation
MeasureThat
.net
Create a benchmark
Tools
Feedback
FAQ
Register
Log In
getMiddle: Math.floor vs num % 2
(version: 1)
Math.floor(num / 2) vs (num % 2 ? (num - 1) / 2 : num / 2)
Comparing performance of:
getMiddleFloor vs getMiddle
Created:
one year ago
by:
Guest
Go to the latest result
HTML Preparation code:
<!--your preparation HTML code goes here-->
Script Preparation code:
const getMiddleFloor = (num) => Math.floor(num / 2); const getMiddle = (num) => (num % 2 ? (num - 1) / 2 : num / 2); const random = (min, max) => Math.floor(Math.random() * (max - min)) + min; const arr = Array.from({ length: 10000 }, () => random(0, 10000));
Tests:
getMiddleFloor
const result = arr.map(i => getMiddleFloor(i));
getMiddle
const result2 = arr.map(i => getMiddle(i));
Rendered benchmark preparation results:
Suite status:
<idle, ready to run>
Run tests (2)
Previous results
Fork
Test case name
Result
getMiddleFloor
getMiddle
Fastest:
N/A
Slowest:
N/A
Latest run results:
Run details:
(Test run date:
one year ago
)
User agent:
Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/18.6 Safari/605.1.15
Browser/OS:
Safari 18 on Mac OS X 10.15.7
View result in a separate tab
Embed
Embed Benchmark Result
<iframe src="https://measurethat.net/Embed?id=615412" width="100%" height="500px"></iframe>
getMiddleFloor
58K/s
getMiddle
52K/s
View exact numbers
Test name
Executions per second
✓
getMiddleFloor
58,115 Ops/sec
getMiddle
51,617 Ops/sec
Related benchmarks
Set.has v.s Array.includes
Math.floor(N) vs (N | 0) vs parseInt(N)
Modulo VS bitwise AND for finding odd number
Array.at(i) vs Array[i]
Array timing 100
Comments
Confirm delete:
Do you really want to delete benchmark?