Think Data Structures: Algorithms and Information Retrieval in Java
Allen Downey's Think Data Structures: Algorithms and information retrieval in Java text
Table of Contents
Interfaces
Analysis of Algorithms (Big O)
ArrayList
LinkedList
Doubly Linked List
Insertion Sort
Selection Sort
Merge Sort
Radix Sort
Tree Traversal
The Map Interface
Hashing and HashMaps
Binary Search Trees
Heap and Bounded Heap Sort
Graphs and Redis to build a search engine
Book Description
"If you’re a student studying computer science or a software developer preparing for technical interviews, this practical book will help you learn and review some of the most important ideas in software engineering—data structures and algorithms—in a way that’s clearer, more concise, and more engaging than other materials.
By emphasizing practical knowledge and skills over theory, author Allen Downey shows you how to use data structures to implement efficient algorithms, and then analyze and measure their performance. You’ll explore the important classes in the Java collections framework (JCF), how they’re implemented, and how they’re expected to perform. Each chapter presents hands-on exercises supported by test code online.
Use data structures such as lists and maps, and understand how they work
Build an application that reads Wikipedia pages, parses the contents, and navigates the resulting data tree
Analyze code to predict how fast it will run and how much memory it will require
Write classes that implement the Map interface, using a hash table and binary search tree
Build a simple web search engine with a crawler, an indexer that stores web page contents, and a retriever that returns user query results"
— Amazon
Learn by Doing Approach
Follow along with the text examples with Codio's fully featured in-browser IDE. With syntax highlighting, built-in debugger, terminal access, and ability to run code with a click of the button, students will be using professional grade tools as they build their skills.
