I am using a abstract data type, which is a linked list of arrays, each one twice as big as the next. Does anyone know if this data-type pre-exists under a different name than "reverse doubling list"?
I've discovered that this data type has the property O(1) growth in the average and worst case, and the property of O(1) indexing in the average case and O(LogN) in the worst case. Is this a noteworthy observation, or is it common knowledge amongst members of the alogrithmic research community. Thanks Christopher Diggins http://www.cdiggins.com
