4 ms·
Interesting Big-O time characteristics, but bit of a pity that addition, removal and membership check require 2 (random) memory accesses. Also, Big-O memory pro
by pipo234 3y ago
Interesting Big-O time characteristics, but bit of a pity that addition, removal and membership check require 2 (random) memory accesses. Also, Big-O memory proportional to element type is a bit of a non-starter in many cases.
- j-pb 3y agoIsn't memory always proportional to element size, unless you just look at indexes and pretend that element storage is free?