Robert Sedgewick

Robert Sedgewick’s Followers (82)

member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo
member photo

Robert Sedgewick



Average rating: 4.28 · 2,510 ratings · 105 reviews · 86 distinct works
Algorithms

by
4.42 avg rating — 1,819 ratings — published 1983 — 30 editions
Rate this book
Clear rating
Algorithms in C, Parts 1-4:...

4.16 avg rating — 157 ratings — published 1997 — 9 editions
Rate this book
Clear rating
Algorithms in C++, Parts 1-...

4.13 avg rating — 130 ratings — published 1998 — 4 editions
Rate this book
Clear rating
Algorithms in C++

3.93 avg rating — 75 ratings — published 1992 — 12 editions
Rate this book
Clear rating
Introduction to Programming...

3.86 avg rating — 66 ratings — published 2007 — 18 editions
Rate this book
Clear rating
Algorithms in Java, Parts 1-4

3.77 avg rating — 65 ratings — published 2002 — 8 editions
Rate this book
Clear rating
Algorithms in C (Computer S...

3.74 avg rating — 61 ratings — published 1990 — 8 editions
Rate this book
Clear rating
An Introduction to the Anal...

by
3.96 avg rating — 49 ratings — published 1995 — 12 editions
Rate this book
Clear rating
Algorithms in C, Part 5: Gr...

3.64 avg rating — 45 ratings — published 2001 — 5 editions
Rate this book
Clear rating
Computer Science: An Interd...

by
4.53 avg rating — 32 ratings — published 2016 — 6 editions
Rate this book
Clear rating
More books by Robert Sedgewick…
Quotes by Robert Sedgewick  (?)
Quotes are added by the Goodreads community and are not verified by Goodreads. (Learn more)

“If all you have is a hammer, everything seems to be a nail.”
Robert Sedgewick, Algorithms, Part II

“Objects are characterized by three essential properties: state, identity, and behavior.”
Robert Sedgewick, Algorithms

“public class MergeBU
{
private static Comparable[] aux; // auxiliary array for merges
// See page 271 for merge() code.
public static void sort(Comparable[] a)
{ // Do lg N passes of pairwise merges.
int N = a.length;
aux = new Comparable[N];
for (int sz = 1; sz < N; sz = sz+sz) // sz: subarray size
for (int lo = 0; lo < N-sz; lo += sz+sz) // lo: subarray index
merge(a, lo, lo+sz-1, Math.min(lo+sz+sz-1, N-1));
}
}”
Robert Sedgewick, Algorithms



Is this you? Let us know. If not, help out and invite Robert to Goodreads.