CSC300: XCountingRecursion [15/19] Previous pageContentsNext page

file:XCountingRecursion.java [source] [doc-public] [doc-private]
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
package algs14;
import stdlib.*;
public class XCountingRecursion {
  /* testing an integer function */
  public static long f (long N) {
    if (N <= 1) {
      return 1;
    } else {
      long result = f(N-1) * N;     
      numOps = numOps + 1;
      return result;
    }
  }
//  public static String f (long N) {
//    if (N == 0) {
//      return "";
//    } else {
//      String result = "*" + f(N - 1);
//      numOps = numOps + result.length();
//      return result;
//    }
//  }
  private static long numOps;
  public static void main (String[] args) {
    long MIN = 4L; 
    long MAX = 5000L; // If too big, you may get a StackOverflowException
    Stopwatch sw = new Stopwatch ();
    numOps = 0;
    f(MIN);
    double prevCount = numOps;
    double prevTime = sw.elapsedTime ();
    for (long N = MIN*2; N <= MAX; N=N*2) {
      sw = new Stopwatch ();
      numOps = 0;
      f(N);
      long count = numOps; 
      double time = sw.elapsedTime ();
      StdOut.format ("Elapsed count f(%,13d): %,17d: %10.3f [%10.3f : %10.3f]\n", N, count, count / prevCount, time, time/prevTime);
      //StdOut.format ("Elapsed count f(%,13d): %,17d: %10.3f\n", N, count, count / prevCount);
      prevCount = count;
      prevTime = time;
    }
  }
}

Previous pageContentsNext page