>>13
Do some benchmarking. Dynamic arrays are always faster than a linked list. Even if the array needs to be resized several times, the difference between O(1) and O(n) is huge. If you ever wrote anything non-trivial with linked lists you'd know that. For something like a video game or GUI where the bottleneck is blitting to the screen, it doesn't matter much, but for a low-level program or a trivial script, a linked list just says ``I can't into memory management and pointer safety''. Plus arrays are primitive, lists are not. They're even simpler to use if you understand them and know how to use them safely. Read the fuqin standard.