Actually, I think access based on an index will be O(log(n)), because you’ll still be searching down through a B-Tree-esque organization to get to your record.
Actually, I think access based on an index will be O(log(n)), because you’ll still be searching down through a B-Tree-esque organization to get to your record.