3 ms·
You're wrong about this. g in O(f) is defined as: There exists c, m such that for all n > m , c*f(n)>g(n). Big O notation doesn't care about algorithms or worst
by ouid 7y ago
You're wrong about this. g in O(f) is defined as: There exists c, m such that for all n > m , c*f(n)>g(n). Big O notation doesn't care about algorithms or worst cases.
- darawk 7y agoNo, it doesn't care about worst cases. But the asymptotics of the generalized function of the runtime by necessity are it's worst case.