News for hackers. Stuff that matters.
Re:Big-O Algorithm Complexity Cheat Sheet by dllthomas on Saturday May 04, 2013 @01:31PM (#5655578)
Though with a gap buffer, you can have O(1) to insert/delete at some other point. Costs O(n) to move that point, though.

There are no comments on this comment yet.