Answer, and explain: For large lists, which of the following is true of inserting a new item into a linked list compared to insertion in an array? What of small lists?

a. more efficient.
b. less efficient.
c. about the same.
d. depends on the size of the two lists.

The best answer is d) depends on the size of the two lists. For large lists, part a), more efficient is correct, for small lists, part c), about the same is correct.
Explanation: Part a) Inserting a new item into a large linked list is more efficient than insertion into a large array. If we are inserting into a list, you have about 5 operations, most of which are pointer assignments, regardless of the list size. If you insert into an array, on the average, you have to move about half the array entries to insert a data item. For small lists, the answer is c) about the same.