May 2019
Intermediate to advanced
698 pages
17h 21m
English
In a word: search. The number of steps required to retrieve a single item is linear (it will take as many steps to find an item as there are items in the list ), in the worst case. Commonly, the time would be at the level of a binary search tree!
In more practical terms, this would provide the ability to store large amounts of data in a list and quickly find the items that you were looking for. However, there is more; here is a list of upsides:
Yet, there are downsides to this list.
Read now
Unlock full access