I have been trying to find a efficient Linear Container Data Structure which can support:

1. Fast access to any index

2. Fast insert after any index

For example:

Initial structure: Index: 0 1 2 3 4 5 Data: 7 19 1 3 12 2

Accessing index 4 gives 12

Accessing index 5 gives 2

After I insert 5 after index 2: Index: 0 1 2 3 4 5 6 Data: 7 19 1 5 3 12 2

Accessing index 4 now gives 3

Accessing index 5 gives 12