title: ArrayList vs. Queue time complexity
body: <p>If I am trying to remove the first element (index 0), would it be more time efficient to do list.remove(0) &lt;- removes index 0 or use a queue and queue.dequeue(). I know delete for arraylist is o(n), does this still hold true if you provide the index to remove from? I am new to Java and algorithms, please bear with me if this is a dumb question</p>