Master your Minecraft
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Tour our stores


    Recently Viewed clear list


    The Powell's Playlist | October 21, 2014

    Anne Rice: IMG The Powell’s Playlist: Anne Rice



    These are the songs that wake me up, take me out of my worries and anxieties, wash my brain cells, and send me to the keyboard to write with new... Continue »

    spacer
Qualifying orders ship free.
$77.50
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
1 Remote Warehouse Software Engineering- Programming and Languages

Other titles in the Algorithms in Java series:

Algorithms in Java 3RD Edition Parts 1-4 Fundame

by

Algorithms in Java 3RD Edition Parts 1-4 Fundame Cover

 

Synopses & Reviews

Publisher Comments:

Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive.

--William A. Ward, University of South Alabama

This edition of Robert Sedgewick's popular work provides current and comprehensive coverage of important algorithms for Java programmers. Michael Schidlowsky and Sedgewick have developed new Java implementations that both express the methods in a concise and direct manner and provide programmers with the practical means to test them on real applications.

Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 400,000 programmers!

This particular book, Parts 1-4 , represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Schidlowsky and Sedgewick also exploit the natural match between Java classes and abstract data type (ADT) implementations.

    Highlights
  • Java class implementations of more than 100 important practical algorithms
  • Emphasis on ADTs, modular programming, and object-oriented programming
  • Extensive coverage of arrays, linked lists, trees, and other fundamental data structures
  • Thorough treatment of algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT implementations (search algorithms)
  • Complete implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and many other advanced methods
  • Quantitative information about the algorithms that gives you a basis for comparing them
  • More than 1,000 exercises and more than 250 detailed figures to help you learn properties of the algorithms

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

0201361205B08282002

Book News Annotation:

This volume comprises a new edition of the first half of Sedgewick's (computer science, Princeton, U.) complete work. Sixteen chapters present Java class implementations of about 100 important practical algorithms, and address topics such as ADTs, modular, and object oriented programming; arrays, linked lists, trees, and other data structures; algorithms for sorting, selection, priority queue ADT implementations, and search algorithms; and implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway ties, and other advanced methods.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

By blending theory and practice, this book appeals equally to both the academic and professional markets. For the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. The author has developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications.

Synopsis:

For the first time, Robert Sedgewick's popular textbook on algorithms and data structures is available in a Java version. Tim Lindholm (co-author of The Java Virtual Machine Specification) and Sedgewick have developed new Java implementations that both express the presented methods in a concise and direct manner, and also provide students with the practical means to test them on real applications. This particular book, Parts 1-4, represents a substantial update of the first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The update features expanded coverage of arrays, linked lists, strings, trees, and other basic data structures, and greater emphasis on abstract data types (ADT's) and object-oriented programming. It includes over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations, and over 1000 new exercises to help students learn the properties of algorithms.

About the Author

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

0201361205AB06262002

Table of Contents

v. 1. Parts 1-4: fundamentals, data structures, sorting, searching --

Product Details

ISBN:
9780201361209
Author:
Sedgewick, Robert
Author:
Lindholm, Tim
Publisher:
Addison-Wesley Professional
Location:
Boston
Subject:
Computer Science
Subject:
Programming Languages - General
Subject:
Programming - General
Subject:
Java (Computer program language)
Subject:
Computer algorithms
Subject:
Java
Subject:
Software Engineering - Programming and Languages
Copyright:
Edition Number:
3
Edition Description:
Trade paper
Series:
Algorithms in Java
Series Volume:
1-4
Publication Date:
July 2002
Binding:
TRADE PAPER
Grade Level:
Professional and scholarly
Language:
English
Illustrations:
Yes
Pages:
1200
Dimensions:
9.5 x 8 x 2 in 2041 gr

Other books you might like

  1. Algorithms in Java 3RD Edition Part... Used Trade Paper $25.00
  2. Building Parsers with Java(tm) with... New Trade Paper $56.95
  3. Java Regular Expressions: Taming the...
    New Trade Paper $39.99
  4. Java 1.5 Tiger (Developer's Notebook) New Trade Paper $34.99
  5. Learning Perl Objects, References,... Used Trade Paper $13.50
  6. Buddhism in Practice (Princeton... Used Trade Paper $8.95

Related Subjects

Computers and Internet » Computer Languages » Java
Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Computers and Internet » Software Engineering » Programming and Languages

Algorithms in Java 3RD Edition Parts 1-4 Fundame New Trade Paper
0 stars - 0 reviews
$77.50 In Stock
Product details 1200 pages Addison-Wesley Professional - English 9780201361209 Reviews:
"Synopsis" by , By blending theory and practice, this book appeals equally to both the academic and professional markets. For the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. The author has developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications.
"Synopsis" by , For the first time, Robert Sedgewick's popular textbook on algorithms and data structures is available in a Java version. Tim Lindholm (co-author of The Java Virtual Machine Specification) and Sedgewick have developed new Java implementations that both express the presented methods in a concise and direct manner, and also provide students with the practical means to test them on real applications. This particular book, Parts 1-4, represents a substantial update of the first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The update features expanded coverage of arrays, linked lists, strings, trees, and other basic data structures, and greater emphasis on abstract data types (ADT's) and object-oriented programming. It includes over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations, and over 1000 new exercises to help students learn the properties of algorithms.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.