BookFronter
Data Structures and Algorithm Analysis in Java by Mark A. Weiss

Data Structures and Algorithm Analysis in Java

3rd Edition

Mark A. Weiss

Pearson Education · Print & ebook · November 18, 2011

Java ProgrammingAlgorithmsComputer Science
Buy on Amazon

We earn from qualifying purchases.

Who it’s for
Explore Java programming and algorithm analysis together, from binary heaps and sorting to NP-completeness.
Themes
Data structures and algorithms, Algorithm analysis, Efficient Java programming
Genres
Algorithms, Java Programming, Computer Science

Nearest books

Matched by what the books are about, then ordered by what their readers also loved. Most of these share its genre: Java Programming.

  1. Linear Algebra and Its ApplicationsGilbert Strang48% match
  2. Modern Java in ActionRaoul-Gabriel Urma, Mario Fusco53% match
  3. Linux Kernel DevelopmentRobert Love49% match
  4. Effective JavaJoshua Bloch63% match
  5. Java Concurrency in PracticeBrian Goetz, Tim Peierls53% match
  6. Data Structures and Algorithms in JavaRobert Lafore75% matchAlso shares Algorithms
  7. Data Structures and Algorithms in JavaMichael T. Goodrich, Roberto Tamassia72% matchAlso shares Algorithms
  8. Data Structures and Abstractions With JavaFrank M. Carrano, Timothy M. Henry69% matchAlso shares Algorithms and Computer Science

For younger readers: The CS Detective

Start with three books, and this one can be the first.

Members get a new edition every morning: a route out from their books to essays, research and talks, with the reason for each.

Start with this book

About this book

Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency.

Continue reading

Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java. Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.

Algorithms in Java

Explore Java programming and algorithm analysis together, from binary heaps and sorting to NP-completeness.

Come here for

  • Binary heaps, sorting, and NP-completeness
  • A full chapter on amortized analysis and advanced data structures

Expect

  • Figures and examples trace successive stages of algorithms
  • Source code accompanies a logically organized text

Where it sits

Algorithms89%
Java Programming69%
Computer Science42%

Percentages are BookFrontier’s reading of the book.

Publisher categories

  • Systems Design
  • Java Programming
  • Algorithms
Authors
Mark A. Weiss
Publisher
Pearson Education
Published
November 18, 2011
Format
Print & ebook
Theme
Data structures and algorithms · Algorithm analysis · Efficient Java programming
Reading lane
Systems Design