Robert Sedgewick
Author of Algorithms
About the Author
Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University
Series
Works by Robert Sedgewick
Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd Edition) (1997) 177 copies
Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching (3rd Edition) (1992) 86 copies, 1 review
Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (2001) 45 copies
Bundle of Algorithms in Java, Third Edition, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5) (2003) 15 copies
Algorithms in c. 3rd edition 1 copy
Tagged
Common Knowledge
- Birthdate
- 1946-12-20
- Gender
- male
- Education
- Stanford University (PhD)
- Occupations
- computer scientist
William O. Baker Professor of Computer Science, Princeton University
Chairman of the Computer Science Department, Princeton University - Organizations
- ACM (Fellow, 1997)
Princeton University - Relationships
- Knuth, Donald (Doctoral Advisor)
- Nationality
- USA
- Birthplace
- USA
- Associated Place (for map)
- USA
Members
Reviews
This should probably be three stars, but I just can't make myself say "I liked it" because it's attached to the worst class I've ever taken. The book is fine and presents Algorithms in a decent way. The companion videos are very helpful for breaking down the examples. But this is material that I would only read if I were taking a class for it or was a hardcore programmer.
I have several books by Sedgewick. Long ago, I loaned out my copy of Algorithms in C++ (never fear, I had the first, and also one in C), and never saw it again. That was the last book I ever loaned out. This book, on how to analyze algorithms, is a thing of beauty, and I enjoy reading it for the pleasure of it.
From the foreword (yes, by THAT D. Knuth): "People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that show more surround elegant computational procedures. Then the receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically."
I couldn't say it better than that. show less
From the foreword (yes, by THAT D. Knuth): "People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that show more surround elegant computational procedures. Then the receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically."
I couldn't say it better than that. show less
This book was a life saver, over and over, when I was working on implementing various graphics and imaging routines. The use of PASCAL (or something close enough to PASCAL) for the code examples made it simple to reimplement. When Sedgewick brought the same book out (with a few updates) for C. I bought it instantly. I got it again when it was in C++ (but sadly, someone borrowed it, years ago).
I bought this book for the course on coursera.org. I ordered it from informit and it arrived immediately.
It is a beautiful hardback edition, with ~950 fine quality pages and typography.
I love it, I used it a lot in my assignments and exercises, it is really clear and helpful, the index makes it very easy to find the answer to your questions.
The first part of the course covered half of it, and I will take the other part too, because the professor makes it really pleasant to study algorithms.
It is a beautiful hardback edition, with ~950 fine quality pages and typography.
I love it, I used it a lot in my assignments and exercises, it is really clear and helpful, the index makes it very easy to find the answer to your questions.
The first part of the course covered half of it, and I will take the other part too, because the professor makes it really pleasant to study algorithms.
You May Also Like
Associated Authors
Statistics
- Works
- 28
- Members
- 1,948
- Popularity
- #13,209
- Rating
- 3.9
- Reviews
- 11
- ISBNs
- 93
- Languages
- 7
- Favorited
- 1













