How the stl vector provides random access

Question

Last night I used std :: vector for my work, and this question popped up in my head: how does a vector give random access?

I tried to learn the code, but was unsuccessful. Can someone give some pointers?

Thanks Arun

Answer 1

A vector uses adjacent memory at the bottom, so it gives random access just like an array: it knows the starting address and size of the elements and does some math pointer.

Answer 2

Of course, here are a few pointers:

int *x, *y;

, vector . ([]), .

Answer 3

[*]... , O (1) ( ) .

( ) (. ). , , 2, n- , (2 * n) (4 * n)-th ...

, , N O (N). , , - .

[*] , . -?

Answer 4

, 1,5 , , .