For an array list, the overall cost of insertion into the list in the worst-case scenario is proportional to the size of the list at the time of insert (including both the seek, insert, and possible shift operations). For a linked list, the overall cost of insertion into the list in the worst-case scenario is proportional to the size of the list at the time of insert (including both the seek and insertion
