- Read only look-up table
- Class roster
- When lots of inserts & deletes are involved
- When you have no clue about how big the list will grow
Read only look-up table:
Since there are no insertion or deletion involved, you can read both an array and a list in O(n) time for n inputs. However, a special version of arrays are hash tables which ...
Which data structure (i.e. array based list or linked list) is the optimum one for following problems?