Hello! I am optimizing my code in R and for this I need to know a bit more about the internals. It would help tremendously if someone could link me to a page with O()-complexities of all the operations.
In this particular case, I need something like a linked list with O(1) insertLast/First ability. I can't preallocate a vector since I do not know the final size of the list ahead of time. The classic array-doubling trick would give me O(1) amortized time but it's a bit messy. The other alternative I see would be to recursively store lists (elem, (elem, (elem, (...)))), which I take also would work? But I'd rather go for a standard R solution if there is one! cheers, /Johan -- -- ----------------------------------------------------------- Johan Henriksson, PhD Karolinska Institutet Ecobima AB - Custom solutions for life sciences http://www.ecobima.se <http://www.ecobima.com> http://mahogny.areta.org http://www.endrov.net <http://www.endrov.net> [[alternative HTML version deleted]] ______________________________________________ R-help@r-project.org mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
