Is there any data structure that has the random access feature of an array and the element insertion efficiency of a linked list

Question

Maybe not because I can't find such type of data structure when I do a search.

Answer 1

To be able to access the element at position i without going through previous elements and to be able to insert an element at position j without shifting subsequent elements. Why? Perhaps for computational efficiency and have a high speed of operation.

Answer 2

Dynamic arrays. vector in C, List in C#, ArrayList in Java

Answer 3

No I don't think so. Every data structure has its own complexity to an algorithm and features which make the algo simpler. As arrays are best for accessing and linked lists for insertion and deletion. Please let me know if there is some data type you're looking for.👍

Answer 4

But why would you want such a data structure?

Answer 5

Did you ever thought about SQL ? This is on my opinion the best option Sonic.

Answer 6

I would say hashtable could match what your are looking for. It is quite efficient for accessing and inserting data.

Answer 7

Try Ruby!😃