News for hackers. Stuff that matters.
Re:Why databases use ordered indexes but programming uses ha... by pwildani on Monday December 09, 2019 @09:57PM (#21749201)
The actual analysis of inserts are that they take "amortized O(1) with a single operation worst case of O(N)"

So N operations take N measurement units as N goes to infinity, but any individual operation may be slower or faster.

There are no comments on this comment yet.