algorithm - What's the Big-O of T(n)=Constant? -


would o(constant)?

example:
t(n) = 10
correct big-o o(10)?

we write o(1) since constant factors aren't relevant.

of course 0 constant mathematically quite distinct. our practical purposes, nothing takes no time in cases, unless aren't doing it. , if aren't doing it, don't care.


Comments

Popular posts from this blog

android - Pass an Serializable object in AIDL -

php - Improving script execution time -

How to provide Authorization & Authentication using Asp.net, C#? -