Below is the syntax highlighted version of TwoSum.java
from §1.4 Analysis of Algorithms.
/****************************************************************************** * Compilation: javac TwoSum.java * Execution: java TwoSum input.txt * Dependencies: StdOut.java In.java Stopwatch.java * Data files: https://algs4.cs.princeton.edu/14analysis/1Kints.txt * https://algs4.cs.princeton.edu/14analysis/2Kints.txt * https://algs4.cs.princeton.edu/14analysis/4Kints.txt * https://algs4.cs.princeton.edu/14analysis/8Kints.txt * https://algs4.cs.princeton.edu/14analysis/16Kints.txt * https://algs4.cs.princeton.edu/14analysis/32Kints.txt * https://algs4.cs.princeton.edu/14analysis/1Mints.txt * * A program with n^2 running time. Reads n integers * and counts the number of pairs that sum to exactly 0. * * * Limitations * ----------- * - we ignore integer overflow * * * % java TwoSum 2Kints.txt * 2 * * % java TwoSum 1Kints.txt * 1 * * % java TwoSum 2Kints.txt * 2 * * % java TwoSum 4Kints.txt * 3 * * % java TwoSum 8Kints.txt * 19 * * % java TwoSum 16Kints.txt * 66 * * % java TwoSum 32Kints.txt * 273 * ******************************************************************************/ public class TwoSum { // print distinct pairs (i, j) such that a[i] + a[j] = 0 public static void printAll(int[] a) { int n = a.length; for (int i = 0; i < n; i++) { for (int j = i+1; j < n; j++) { if (a[i] + a[j] == 0) { StdOut.println(a[i] + " " + a[j]); } } } } // return number of distinct pairs (i, j) such that a[i] + a[j] = 0 public static int count(int[] a) { int n = a.length; int count = 0; for (int i = 0; i < n; i++) { for (int j = i+1; j < n; j++) { if (a[i] + a[j] == 0) { count++; } } } return count; } public static void main(String[] args) { In in = new In(args[0]); int[] a = in.readAllInts(); Stopwatch timer = new Stopwatch(); int count = count(a); StdOut.println("elapsed time = " + timer.elapsedTime()); StdOut.println(count); } }