in reply to Traditional Linked List and Perl's built-in Data Structure

as in any language, inserting and deleting elements on the middle of big arrays is an expensive operation: O(N), while on linked lists, you can do it on O(1).
  • Comment on Re: Traditional Linked List and Perl's built-in Data Structure