>>34
You fucking idiot. You are what's wrong with 99% of the programmers. You think you know the problem, so you apply crappy solution. How about doing some research before
Linked lists are slow as hell. Sure they seem like O(1) but in real world conditions they are terrible. They take more memory. They destroy cache. They just suck. Dynamic arrays are always faster, if you only have to insert to the end and if you do it right.
There's even no copying of data included if you use 4k (or whatever the page size is) chunks to allocate array. The OS just creates new page and puts it after your last page and the base pointer stays the same when you "realloc()".