Robert Sedgewick
|
Algorithms
by
—
published
1983
—
30 editions
|
|
|
Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching
—
published
1997
—
9 editions
|
|
|
Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition
—
published
1998
—
4 editions
|
|
|
Algorithms in C++
—
published
1992
—
12 editions
|
|
|
Introduction to Programming in Java: An Interdisciplinary Approach
—
published
2007
—
18 editions
|
|
|
Algorithms in Java, Parts 1-4
—
published
2002
—
8 editions
|
|
|
Algorithms in C (Computer Science Series)
—
published
1990
—
8 editions
|
|
|
An Introduction to the Analysis of Algorithms
by
—
published
1995
—
12 editions
|
|
|
Algorithms in C, Part 5: Graph Algorithms
—
published
2001
—
5 editions
|
|
|
Computer Science: An Interdisciplinary Approach
by
—
published
2016
—
6 editions
|
|
“Objects are characterized by three essential properties: state, identity, and behavior.”
― Algorithms
― 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));
}
}”
― Algorithms
{
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));
}
}”
― Algorithms
Is this you? Let us know. If not, help out and invite Robert to Goodreads.






















