Yeah, something like a finger tree is amortized constant time for sequential access, but log(n) for random access away from the ends. What is nearly ALWAYS ove

Yeah, something like a finger tree is amortized constant time for sequential access, but log(n) for random access away from the ends. What is nearly ALWAYS overlooked is constant factors. A finger tree is in a nice complexity class, but still requires a lot of per-object overhead compared to an array, that can turn a 10MB chunk of data into a 100MB data structure.