‹#›
30
Efficiency...
•If a linked list is used, we must traverse to the correct spot to
insert into sorted order
•If the array is not sorted, and we are inserting at the
beginning or the end, an array is extremely efficient...direct access for both arrays
and linked lists why?
•Would you need a tail pointer now????