Re:Why databases use ordered indexes but programming uses ha...
by ouid on Tuesday December 10, 2019 @10:37AM
(#21753407)
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.
[ Parent
| on HN ]