News for hackers. Stuff that matters.
Re:How to implement a hash table in C by justinpombrio on Friday March 26, 2021 @05:35PM (#26597236)
Amortized cost is a technical term in complexity analysis: https://en.wikipedia.org/wiki/Amortized_analysis

If you use the terminology precisely, the worst case cost of a regular hash table insertion is O(n) because of the potential resize, but its amortized cost is O(1) because that's what it "averages out to".

There are no comments on this comment yet.