CS 228 meeting -*- Outline -*-

* comparison between dynamic and array implementations

	the implementation with shifting in an array is very slow
	compared to these
------------------------------------------
   COMPARING IMPLEMENTATION TECHNIQUES
               FOR LISTS

             Array w/      Linked Lists
             shifting   Array     Dynamic

Fixed size?

Space used   

Insert time    O(n)

Delete time
------------------------------------------


Fixed size?     yes      yes       no

Space used    maximum  < maximum  O(n)

	constants for insert and delete larger for dynamic than array

	may be a fair bit of overhead for dynamic data,
		both in space and time.

	The array implementation *trades space for time*
		to get rid of some of that overhead

	also spends programer time.

* example: implementing list with linked list (HR pp. 365) 

	do if time