Algorithms 4th Edition fully covers the various types of algorithms used in the field of computer science.
Summary Of The Book
An algorithm is a sequence of well defined steps, that, if followed carefully, leads to the solution of a problem. Algorithms are naturally associated with the field of computer science and programming, but it also has applications in physics and in genetic sequencing.
Algorithms 4th Edition, divided into six chapters, covers every aspect of algorithms from the fundamentals to the applications.
The book starts with a look at the fundamentals. This chapter provides a solid technical foundation for comparing algorithms and predicting outcomes. It includes coverage of programming model, data abstraction, and analysis of algorithms. It also includes a case study.
The second chapter looks at sorting algorithms. It covers many classical sorting algorithms including mergesort, quicksort, insertion sort and a priority queue implemented using a binary heap. It also covers applications of these algorithms.
The next chapter discusses the graph algorithms. It explains directed and undirected sorts, short paths and minimum spanning trees. The fifth chapter takes an in-depth look at string sorting algorithm. It discusses radix sorting, tries, substring searches, regular expressions and data compression.
The final chapter, Context, discusses applications of algorithms in various fields - operations research, systems programming, scientific computing, and commercial applications.
Algorithms 4th Edition incorporates techniques developed over several decades and explains it all in a precise and concise fashion. Using many interesting examples and illustrations, the authors also highlight the many practical applications of these abstract concepts in many different fields.
The companion book site contains important excerpts from the book, Java codes, and exercises.
About The Authors
Robert Sedgewick is an American Professor of Computer Science and an author.
Other books by Sedgewick are An Introduction To The Analysis Of Algorithms, Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching 0003 Edition and Algorithms in C: Fundamentals, Data Structures, Sorting, Searching (Parts 1-4) 3rd Edition.
His books mainly concentrate on the concept of algorithms.
He has held visiting research positions at organizations like INRIA and Xerox PARC, and is on the Board of Directors of Adobe Systems.
Robert Sedgewick is the Professor of Computer Science at Princeton University, where he founded and chaired the Department of Computer Science. His research interests include design and analysis of data structures and algorithms, analytic combinatorics and program visualization.
Kevin Wayne is an academic and an author.
Another book by Kevin Wayne is Introduction To Programming In Java: An Interdisciplinary Approach.
His textbooks deal with computer science and programming related topics.
Kevin Wayne is a Senior Lecturer in Computer Science at Princeton University. He has a doctorate from Cornell University in Operations Research and Industrial Engineering. His fields of interest include design, analysis and implementation of algorithms for graphs and discrete optimization.
Algorithms 4e, Sedgewick & Wayne
Venkateswara Rao Sanaka
4 Oct, 2011
Must Have Book for Graduates
8 Feb, 2012
Good one for beginners who know OOPS
20 Dec, 2012
20 Feb, 2016
A Must Have Book
4 Oct, 2012
please tell where i can get it
18 Feb, 2015