Re:My Favorite Algorithm: Linear Time Median Finding
by _dain_ on Friday July 26, 2024 @11:16AM
(#41079304)
What's wrong with doing it in two passes? N iterations each doing 2 operations is exactly the same cost as 2*N iterations each doing 1 operation. Because multiplication is commutative.
[ Parent
| on HN ]
Re:My Favorite Algorithm: Linear Time Median Finding
by srcreigh on Friday July 26, 2024 @12:10PM
(#41079775)
It’s more like 2NM where M is loading the data from disk/memory. One pass is 2N+M.
Why go to the store and back twice to buy two things instead of buying two things in one trip? ;p
Re:My Favorite Algorithm: Linear Time Median Finding
by jiggawatts on Friday July 26, 2024 @08:01PM
(#41083439)
I think you meant 2N+2M vs 2N+M, but yes, that’s the point: not reading twice is cheaper because unlike in traditional big-O analysis compute is cheap but data access is very expensive.
Re:My Favorite Algorithm: Linear Time Median Finding
by srcreigh on Sunday July 28, 2024 @08:44AM
(#41092819)
Yep, thx.
Re:My Favorite Algorithm: Linear Time Median Finding
by buildbot on Friday July 26, 2024 @11:21AM
(#41079367)
This is true, but a big advantage of the single pass method is data reuse. Instead of loading each element twice, you load each element once. Per bit, reading/writing to external memory is massively more energy intensive than any compute op. Orders of magnitude more.