Lecture 13 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.
Julie introduces linked lists and continues to discuss recursive data. She goes line by line through an example code she writes during the lecture. She then inserts variables in an order; she uses the example of an address book to explain this. Algorithm analysis are also introduced.
Tags: Algorithm, address, analysis, book, code, More…data, example, inserts, line, linked, lists, recursive, variables
You need to be a member of MoreDat to add comments!
Join MoreDat