| Data Structures for Tables |
|
|
|
|
|
|
|
|
|
|
|
|
| • | So,
have you noticed that we have a problem for |
||||||||||
| sorted
tables? |
|||||||||||
| • | Having
a dynamic table requires pointers. |
||||||||||
| • | Having
a good means for retrieving items |
||||||||||
| requires
arrays. |
|||||||||||
| • | Doing
a lot of insertion and deletion is a toss |
||||||||||
| up...probably
an array is best because of the |
|||||||||||
| searching. |
|||||||||||
| • | So,
what happens if you need to DO ALL of |
||||||||||
| these
operations? |
|||||||||||