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. It is also suitable for a first-year graduate course in algorithm analysis
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.
- Object-oriented programming (OOP)
- Publication Date:
- Pearson Education (US)
- Country of origin:
- United States
- 3rd Edition
- Dimensions (mm):
Our Australian supplier has this title on order. You can place a backorder for this title now and we will ship it to you when it becomes available.
While we are unable to provide a delivery estimate, most backorders will be delivered within 120 days. If we are informed by our supplier that the title is no longer available during this time, we will cancel and refund you for this item. Likewise, if no delivery estimate has been provided within 120 days, we will contact our supplier for an update. If there is still no delivery estimate we will then cancel the item and provided you with a refund.
If we are able to secure you a copy of the title, our supplier will despatch it to our Sydney warehouse. Once received we make sure it is in perfect condition and then despatch it to you via the Australia Post eParcel service, which includes online tracking. You will receive a shipping notice from us when this occurs.