15-122 Principles of Imperative Computation
Lecture 6: Unbounded Arrays

• Reading: 06-ubarrays.pdf
• Code: ubarrays.c0, code directory
• Concepts:
  • Structs and fields
  • Pointers
  • alloc(t)
  • Small and large types
  • Aliasing
  • Unbounded arrays with current size and limit
  • Amortized analysis: putting tokens in the bank
  • n operations taking O(n) times
  • All operations have amortized constant time O(1)
• Previous lecture: Subquadratic Sorts
• Next lecture: Lists and Queues

[ Home | Schedule | Assignments | Resources ]
[ Blackboard | academic.cs.15-122 ]

fp@cs
Frank Pfenning