Thanks for the interesting article. Usually, I tend to use LinkedList when I mostly appending a lot of items of which the size I don’t know and/or when I iterate over all elements. When I’m doing a lot of random accesses, I use ArrayList. In your table, both list implementations have O(1), is that still true when the whole array needs to be copied due expansion? And what about actual time? Do you know any benchmarks for different use cases? I really would be interested.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Thanks for the interesting article. Usually, I tend to use LinkedList when I mostly appending a lot of items of which the size I don’t know and/or when I iterate over all elements. When I’m doing a lot of random accesses, I use ArrayList. In your table, both list implementations have O(1), is that still true when the whole array needs to be copied due expansion? And what about actual time? Do you know any benchmarks for different use cases? I really would be interested.