01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
package algs21;
import stdlib.*;
public class XAnimatedSelection {
public static void sort (double[] a) {
int N = a.length;
show (a, 0, 0);
for (int i = 0; i < N; i++) {
int min = i;
for (int j = i + 1; j < N; j++)
if (less (a[j], a[min])) min = j;
show (a, i, min);
exch (a, i, min);
assert isSorted (a, 0, i);
}
assert isSorted (a);
}
private static void show (double[] a, int i, int min) {
StdDraw.clear ();
//StdDraw.setYscale(-a.length + i + 1, i);
StdDraw.setPenColor (StdDraw.LIGHT_GRAY);
for (int k = 0; k < i; k++)
StdDraw.line (k, 0, k, a[k]);
StdDraw.setPenColor (StdDraw.BLACK);
for (int k = i; k < a.length; k++)
StdDraw.line (k, 0, k, a[k]);
StdDraw.setPenColor (StdDraw.BOOK_RED);
StdDraw.line (min, 0, min, a[min]);
StdDraw.show (100);
}
private static boolean less (double v, double w) {
return v < w;
}
private static void exch (double[] a, int i, int j) {
double t = a[i];
a[i] = a[j];
a[j] = t;
}
private static boolean isSorted (double[] a) {
return isSorted (a, 0, a.length - 1);
}
private static boolean isSorted (double[] a, int lo, int hi) {
for (int i = lo + 1; i <= hi; i++)
if (less (a[i], a[i - 1])) return false;
return true;
}
public static void main (String[] args) {
args = new String[] { "25" };
int N = Integer.parseInt (args[0]);
StdDraw.setCanvasSize (N*7, 320);
StdDraw.setXscale (-1, N + 1);
StdDraw.setPenRadius (.006);
sort (ArrayGenerator.doublePartiallySortedUnique (N));
sort (ArrayGenerator.doubleRandomUnique (N));
sort (ArrayGenerator.doubleSortedUnique (N));
sort (ArrayGenerator.doubleReverseSortedUnique (N));
}
}
|