contents big-five summary exercises references algorithm analysis mathematical background model what to analyze running-time calculations simple example general rules solutions for the maximum subsequence sum problem logarithms in the running time limitations of worst-case analysis summary exercises references listsstacksand queues abstract data types (adts the list adt simple array implementation of lists simple linked lists vector and list in the stl iterators exampleusing erase on list const_iterators implementation of vector implementation of list the stack adt stack model implementation of stacks applications the queue adt queue model array implementation of queues applications of queues summary exercises