Anyone noticed how LinkedList beats ArrayList in the CodeGym insertion test. Yet the general consensus is ALWAYS use ArrayList's - even the author (Joshua Bloch) of Java’s Collections framework said 'Does anyone actually use LinkedList? I wrote it, and I never use it.' Then I noticed
list.add(0, new Object());
Isn't the index of 0 just causing the ArrayList to have to push all the elements along by one place each time, rather than just adding it to the end?