>tfw accidentally used a linked list once and now everyone

>has no impact until about 100k elements

>>55511160
>multiples of 2000 seconds (over half an hour)
>no impact

>>55511119
Isn't vector random insert supposed to be much more expensive since it has to move all the later elements and often reallocate memory and move *all* elements? With a linked list, the insertion is trivial.
So is searching the linked list just super slow because the memory isn't contiguous?

itt pajeet who didn't learn basic algorithms

>>55511385
Are you unable to read the post you're replying to? Or are you unable to obtain information from a graph, you retard?

>>55512359
It's all about the cache these days. Vectors lay elements contigously thus being very cache friendly