Complexity of operations, n elements

	array	linked list
insert/delete at beginning	O(n)	O(1)
insert/delete at end	O(1)	O(1) ("doubly-linked" list, with pointer to rear)
insert/delete at middle	O(n)	O(n)
find an element	O(n) (O(log n), if array is sorted)	O(n)
index a specific element	O(1)	O(n)