DoublingRatio.java
3.28 KB
1
2
3
4
5
6
7
8
9
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/******************************************************************************
* Compilation: javac DoublingRatio.java
* Execution: java DoublingRatio
* Dependencies: ThreeSum.java Stopwatch.java StdRandom.java StdOut.java
*
*
* % java DoublingRatio
* 250 0.0 2.7
* 500 0.0 4.8
* 1000 0.1 6.9
* 2000 0.6 7.7
* 4000 4.5 8.0
* 8000 35.7 8.0
* ...
*
******************************************************************************/
package edu.princeton.cs.algs4;
/**
* The {@code DoublingRatio} class provides a client for measuring
* the running time of a method using a doubling ratio test.
* <p>
* For additional documentation, see <a href="http://algs4.cs.princeton.edu/14analysis">Section 1.4</a>
* of <i>Algorithms, 4th Edition</i> by Robert Sedgewick and Kevin Wayne.
*
* @author Robert Sedgewick
* @author Kevin Wayne
*/
public class DoublingRatio {
private static final int MAXIMUM_INTEGER = 1000000;
// This class should not be instantiated.
private DoublingRatio() { }
/**
* Returns the amount of time to call {@code ThreeSum.count()} with <em>n</em>
* random 6-digit integers.
* @param n the number of integers
* @return amount of time (in seconds) to call {@code ThreeSum.count()}
* with <em>n</em> random 6-digit integers
*/
public static double timeTrial(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = StdRandom.uniform(-MAXIMUM_INTEGER, MAXIMUM_INTEGER);
}
Stopwatch timer = new Stopwatch();
ThreeSum.count(a);
return timer.elapsedTime();
}
/**
* Prints table of running times to call {@code ThreeSum.count()}
* for arrays of size 250, 500, 1000, 2000, and so forth, along
* with ratios of running times between successive array sizes.
*
* @param args the command-line arguments
*/
public static void main(String[] args) {
double prev = timeTrial(125);
for (int n = 250; true; n += n) {
double time = timeTrial(n);
StdOut.printf("%6d %7.1f %5.1f\n", n, time, time/prev);
prev = time;
}
}
}
/******************************************************************************
* Copyright 2002-2016, Robert Sedgewick and Kevin Wayne.
*
* This file is part of algs4.jar, which accompanies the textbook
*
* Algorithms, 4th edition by Robert Sedgewick and Kevin Wayne,
* Addison-Wesley Professional, 2011, ISBN 0-321-57351-X.
* http://algs4.cs.princeton.edu
*
*
* algs4.jar is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* algs4.jar is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with algs4.jar. If not, see http://www.gnu.org/licenses.
******************************************************************************/