News for hackers. Stuff that matters.
Re:Big O Notation – Explained as easily as possible by mhh__ on Saturday January 16, 2021 @01:26PM (#25804158)
You'd need to know the exact details of the implementation of your arithmetic library, but it would depend on the integer in question which makes analysis a little harder so adding two numbers would become some function O(f(n, m)) where n, m are the two numbers or some property of them (length, digits etc.)

There are no comments on this comment yet.