How do we store data so that a program stays fast when the data grows from a hundred items to a hundred million? This course answers that question. Students first use the data structures of the Java Collections Framework, then learn to analyse algorithms and prove them correct, and finally build the core structures themselves — lists, stacks, queues, heaps, search trees, hash tables and graphs — understanding exactly why each operation costs what it costs.
Every chapter explains the big idea in plain words first, then follows it step by step in code, so that the hardest course of the programming sequence becomes a manageable one.