News for hackers. Stuff that matters.
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.
Re:Why databases use ordered indexes but programming uses ha... by darawk on Tuesday December 10, 2019 @10:56PM (#21759442)
No, it doesn't care about worst cases. But the asymptotics of the generalized function of the runtime by necessity are it's worst case.