|
|
|
|
|
|
by jameshart
775 days ago
|
|
|
Right. O(f(n)) is literally only defined for situations where n 1: varies between different runs of the algorithm, and 2: can grow arbitrarily large. Even though in practice ‘arbitrarily large’ is always limited by memory, storage, etc. Talking about algorithms being O(n) in the number of bits in a value is only reasonable if the number of bits in the value actually varies between runs. |
|
|