Can you design a hybrid data structure?
Question: Arrays are fast at jumping quickly to a given element, whereas linked lists are fast at insertion after a given element.
You would like to design a hybrid data structure that is fast at both. How about an array whose elements were the nodes of a linked list, so that you could use the array to jump right to the 173rd node and then use the linked list to insert a new node at position 174? Does this work? Clarify.