Flashcards in List And Pointer Deck (7):
What are the advantage of an array/linear list
It's easy to program
If elements are stored in key order, a binary search is possible
What are the disadvantages of linear list/array
Memory locations may be wasted.
Insertion of an element within an ordered list required moving elements.
Deletion of an element within a list requires moving elements
What are pointers?
A pointer is a variable that contains an address. A pointer points to the memory location with that address.
What's an heap?
The memory locations available to application program for dynamic allocation
What's a "dynamic allocation"?
A dynamic allocation: memory space is only allocated when required at run time
What are advantages of the heap?
More efficient use of memory when dealing with data of unknown and changing size