I&C SCI 46 Lecture Notes - Lecture 3: Array Data Structure, Instance Variable, Iterator

• School: UC-Irvine
• Department: Information and Computer Science
• Course: I&C SCI 46
• Professor: Richard Pattis

Document Summary

In this lecture we will discuss the details of the implementation of one data type, set, which is one of the five standard generic data types/collection classes that we have discussed (stack, queue, priority. The implementation that we will discuss in detail uses an array data structure, in a simple way, to store all the values in the set. There are strong similarities between this implementation of set and the array implementations of the other data types; also, set is of middling complexity compared to. Stack, queue, and priority queue (lower) and map (higher), so it is a good class to examine in detail. Please feel free to examine the array implementations of the other data types; you can find these implementations in the courselib project, by looking in its src folder. 2-4, you will write more complicated (but still similar) implementations of many of these templated classes.