PPT Slide
public abstract class Sortable
{ public abstract int compareTo(Sortable b);
}
public class ArrayAlg
{ public static void shellSort(Sortable[] a)
{ int n = a.length;
int incr = n / 2;
while (incr >= 1)
{ for (int i = incr; i < n; i++)
{ Sortable temp = a[i];
int j = i;
while (j >= incr
&& temp.compareTo(a[j - incr]) < 0)
{ a[j] = a[j - incr];
j -= incr;
}
a[j] = temp;
}
incr /= 2;
}
}
}
Previous slide
Next slide
Back to first slide
View graphic version