doubly-linked-list – Tarik Billa

how to implement doubly linked lists

April 10, 2024 by Tarik

It isn’t really practical to have a doubly linked list in Haskell, because you have to construct it all at once. For example, imagine that you have a list [1, 2, 3, 4, 5] that you want to make doubly linked. Now, let’s imagine how the list is represented: data DoubleList a = LeftEnd a … Read more

Performance differences between ArrayList and LinkedList [duplicate]

February 14, 2023 by Tarik

ArrayList is faster than LinkedList if I randomly access its elements. I think random access means “give me the nth element”. Why ArrayList is faster? ArrayList has direct references to every element in the list, so it can get the n-th element in constant time. LinkedList has to traverse the list from the beginning to … Read more