Review: Chapters 1 and 2 of Goodrich et al represent a review of CSC 1253 / 1350 Introduction to Computer Science I and CSC 1254 / 1351 Introduction to Computer Science II. They are there for reference, as needed.
Reading: Chapter 3 of Goodrich et al.
A sequence container is a simple 1-dimensional collection of elements. All sequence containers share the same set of basic operations:
Given a collection containing \(n\) elements, how many steps are required (in the worst-case scenario) to perform each basic operation?
Example: CAT. Append S. Erase T. Insert R after A. Insert T before S.
Which of these containers can be easily enumerated in reverse order?
All of these operations can fail in some fashion. How?
Some of these basic operations be sped up by storing “meta” data. How?
How would you find the smallest element in a collection of numbers? The largest?
If we know the elements appear in some sorted order, how does each of the basic operations change?