News for hackers. Stuff that matters.
Re:Efficient Amortised and Real-Time Queues in Haskell by danidiaz on Saturday January 16, 2016 @03:47AM (#10914753)
"Amortised complexity", a concept so esoteric that is used in the documentation of basic Java data structures: https://docs.oracle.com/javase/8/docs/api/java/util/ArrayLis...

"The add operation runs in amortized constant time, that is, adding n elements requires O(n) time."

There are no comments on this comment yet.