CISC 235 Lecture 1: Week 1
14 May 2016
School
Department
Course
Professor
Document Summary
Equivalently, how would you store a list of existing user-names, so that when a new user selects a user-name you can quickly determine if it has already been taken. These problems all have two things in common: each one. This illustrates the first and crucial point about choosing a data structure to organize a set of information - we need to know what we want to do with it. Some data structures are particularly suited for searching the set, while others are optimal for adding and deleting members of the set, or finding subsets, etc. Thus we need to think about the types of operations we may need to implement for a data set, since these will definitely influence our decision. Remove an element from the set (these first two operations do not necessarily go together: some data sets never grow, and some never shrink)
