Sedgewick R. Algorithms in Java. Parts 1-4...3ed 2008 torrent

Textbook in PDF and CHM formats

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.
THIS BOOK IS the first of three volumes that are intended to survey the most important computer algorithms in use today. This first volume (Parts 1–4) covers fundamental concepts (Part 1), data structures (Part 2), sorting algorithms (Part 3), and searching algorithms (Part 4); the second volume (Part 5) covers graphs and graph algorithms; and the (yet to be published) third volume (Parts 6–8) covers strings (Part 6), computational geometry (Part 7), and advanced algorithms and applications (Part 8).
The books are useful as texts early in the computer science curriculum, after students have acquired basic programming skills and familiarity with computer systems, but before they have taken specialized courses in advanced areas of computer science or computer applications. The books also are useful for self-study or as a reference for people engaged in the development of computer systems or applications programs because they contain implementations of useful algorithms and detailed information on these algorithms’ performance characteristics. The broad perspective taken makes the series an appropriate introduction to the field.
Together the three volumes comprise the Third Edition of a book that has been widely used by students and programmers around the world for many years.
Introduction
Principles of Algorithm Analysis
Elementary Data Structures
Abstract Data Types
Recursion and Trees
Elementary Sorting Methods
Quicksort
Merging and Mergesort
Priority Queues and Heapsort
Radix Sorting
Special-Purpose Sorting Methods
Symbol Tables and BSTs
Balanced Trees
Hashing
Radix Search
External Searching