I seriously hope none of you use linked lists in 2016

linked list is O(1)
array is O(n)

>>56261117
Are you actually handicapped?

>>56263328
Depending on the operation he is right. Insertions/deletions are O(1) on linked lists, O(n) on arrays (except for trivial cases like inserting/deleting at the end of an array, as long as no reallocation is required).

Other than that arrays are superior in every aspect: random access, obviously (O(n) for linked lists, O(1) for arrays) and even sequential access (cache locality and whatnot). You only get bitten in the ass if reallocation happens, really.

>>56261011
>not using a heap