August 2001
Beginner
482 pages
10h 52m
English
Arrays are much like Tupperware. They are great containers, but they are of a fixed size. If you pick a container that is too large, you waste space in your storage area. If you pick one that is too small, its contents spill all over and you have a big mess.
One way to solve this problem is with a linked list. A linked list is a data structure that consists of small containers that “snap together.” |
Containers, in this context, are classes that contain the objects to be held in the list. The idea is to write a class that holds one object of your data—such as one CAT or one Rectangle—and that can point at the next ...
Read now
Unlock full access