Help us caption and translate this video on Amara.org: http://www.amara.org/en/v/BH93/
Lecture 25 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.
Julie examines a case study and opening up the lexicon file, which is complicated; she walks the students through the code and explains why she wrote it as she did as opposed to a sorted vector or binary search tree. She then introduces the DAWG data structure.
Complete Playlist for the Course:
CS 106B Course Website:
Stanford Center for Professional Development:
Stanford University Channel on YouTube: