title: Why is insertion and deletion faster in a linked list compared to an array?
body: <p>Considering that for both linked list and array, inserting/deleting data from middle has O(n) complexity, why is linked list being preferred? <strong>Is array's O(n) <em>(performing the operation)</em> more costly than linked list's <em>(indexing)</em>?</strong></p>