• book

From the Publisher

With its focus on creating efficient data structures and algorithms, this comprehensive text helps readers understand how to select or design the tools that will best solve specific problems. It uses Java as the programming language and is suitable for second-year data structure courses and computer science courses in algorithm analysis.
Techniques for representing data are presented within the context of assessing costs and benefits, promoting an understanding of the principles of algorithm analysis and the effects of a chosen physical medium. The text also explores tradeoff issues, familiarizes readers with the most commonly used data structures and their algorithms, and discusses matching appropriate data structures to applications. The author offers explicit coverage of design patterns encountered in the course of programming the book's basic data structures and algorithms. Numerous examples appear throughout the text.
Published: Dover Publications on
ISBN: 9780486173566
List price: $29.95
Read on Scribd mobile: iPhone, iPad and Android.
Availability for Data Structures and Algorithm Analysis in Java, Third Edi...
With a 30 day free trial you can read online for free
  1. This book can be read on up to 6 mobile devices.

Related Articles

The Atlantic
11 min read

Melinda Gates: The Tech Industry Needs to Fix Its Gender Problem—Now

Long before Melinda Gates was famous for her philanthropic work, she was yet another woman trying to make it in the male-dominated tech world. Gates started working at Microsoft in 1987, when it was still a small, scrappy company. But even for a woman with a degree in computer science and technical skills in her blood (Gates’ father was an engineer) she still had trouble figuring out precisely how she fit into the male-dominated industry. Thirty years later, many women are still asking themselves that question. Women make up an even smaller share of computer-science majors than they did when s
7 min read

A Formula That Shows How to Cheat & Triumph at Tournaments

Gryffindor and Slytherin are about to play their annual badminton match. The best players from each house are supposed to face off on court one, the second best on court two, and so on. Slytherin’s coach knows that Gryffindor will put their players on the right courts, in order of their skill, because Gryffindors are honest. It’s up to him to teach them the error of their ways. After all, honesty is nothing but a wasted opportunity to cheat. By strategically putting his players in a different order, can he increase the number of games his team is expected to win? If so, what is the best or
5 min read

The Fundamental Limits of Machine Learning

A few months ago, my aunt sent her colleagues an email with the subject, “Math Problem! What is the answer?” It contained a deceptively simple puzzle: She thought her solution was obvious. Her colleagues, though, were sure their solution was correct—and the two didn’t match. Was the problem with one of their answers, or with the puzzle itself? My aunt and her colleagues had stumbled across a fundamental problem in machine learning, the study of computers that learn. Almost all of the learning we expect our computers to do—and much of the learning we ourselves do —is about reducing information