News for hackers. Stuff that matters.

A comment on Linear O(N) sorting with Radix Sort (2000). Parent comment

Re:Linear O(N) sorting with Radix Sort (2000) by pfdietz on Tuesday February 01, 2022 @10:20AM (#30163644)
The model I usually consider is a RAM where the word size is ~ logn bits. This seems closest to real computers.
[ Parent | on HN ]
Re:Linear O(N) sorting with Radix Sort (2000) by __s on Tuesday February 01, 2022 @10:41AM (#30163981)
I find this article pretty insightful for thinking about algorithms that involve lots of memory: http://www.ilikebigbits.com/2014_04_21_myth_of_ram_1.html
[ Parent | on HN ]
Re:Linear O(N) sorting with Radix Sort (2000) by Radim on Tuesday February 01, 2022 @01:12PM (#30166644)
That article's discussion on HN (6 years ago!) was also quite interesting:

https://news.ycombinator.com/item?id=12383012

[ Parent | on HN ]