News for hackers. Stuff that matters.

A comment on Finding the average of two unsigned integers without overflow. Parent comment

Re:Finding the average of two unsigned integers without over... by hackthefender on Monday February 07, 2022 @09:26PM (#30254244)
> Clearly we have both had miraculous enlightenment because legally this is “not obvious”.

To be precise, legally it is "not obvious back in 1996." There is a lot of stuff that is obvious today that wasn't 25 years ago. That said, this one in particular probably would have been invalidated as obvious if it was ever litigated (and it was not). Also, the USPTO has reined in software patents a lot in recent years (but always people advocating for more or less).

[ Parent | on HN ]
Re:Finding the average of two unsigned integers without over... by doctor_eval on Monday February 07, 2022 @10:36PM (#30254632)
Seriously, I could have done this in 1996 and so could anyone. I reckon I could probably have worked this out in 1986. It’s not like binary arithmetic has changed significantly in the last 20 years.
[ Parent | on HN ]
Re:Finding the average of two unsigned integers without over... by unnah on Tuesday February 08, 2022 @01:43AM (#30255582)
And back in 1996, programmers were much more familiar with bit-twiddling than today.
[ Parent | on HN ]
Re:Finding the average of two unsigned integers without over... by ______-_-______ on Monday February 07, 2022 @10:53PM (#30254737)
It's not even computer science, it's literally just math. (a+b)/2 = a/2 + b/2. They were teaching that in pre-algebra in middle schools well before 1996.
[ Parent | on HN ]