Compilation: javac Accumulator.java Mutable data type that calculates mean of data values.

Compilation: javac AcyclicLP.java Execution: java AcyclicP V E Dependencies: EdgeWeightedDigraph.java DirectedEdge.java Topological.java Data f

Compilation: javac AcyclicSP.java Execution: java AcyclicSP V E Dependencies: EdgeWeightedDigraph.java DirectedEdge.java Topological.java Data

Compilation: javac Arbitrage.java Execution: java Arbitrage < input.txt Dependencies: EdgeWeightedDigraph.java DirectedEdge.java

Compilation: javac AssignmentProblem.java Execution: java AssignmentProblem N Dependencies: DijkstraSP.java DirectedEdge.java Solve an N-by-N

Compilation: javac Average.java Execution: java Average < data.txt Dependencies: StdIn.java StdOut.java Reads in a sequence of real numbers, a

Compilation: javac BST.java Execution: java BST Dependencies: StdIn.java StdOut.java Data files: http://algs4.cs.princeton.edu/32bst/tinyST.t

Compilation: javac BTree.java Execution: java BTree B-tree. Limitations ----------- - Assumes M is even and M >= 4 - should b be an ar

The <tt>Bag</tt> class represents a bag (or multiset) of generic items. It supports insertion and iterating over the items in arbitrary order. <p>

Compilation: javac BellmanFordSP.java Execution: java BellmanFordSP filename.txt s Dependencies: EdgeWeightedDigraph.java DirectedEdge.java Queu

Compilation: javac BinaryDump.java Execution: java BinaryDump N < file Dependencies: BinaryStdIn.java Data file: http://introcs.cs.princeton

Compilation: javac BinaryDump.java Execution: java BinaryDump N < file Dependencies: BinaryStdIn.java Data file: http://introcs.cs.princeton

<i>Binary input</i>. This class provides methods for reading in bits from a binary input stream, either one bit at a time (as a <tt>boolean</tt>),

<i>Binary output</i>. This class provides methods for converting primtive type variables (<tt>boolean</tt>, <tt>byte</tt>, <tt>char</tt>, <tt>int</t

Compilation: javac BinarySearchST.java Execution: java BinarySearchST Dependencies: StdIn.java StdOut.java Data files: http://algs4.cs.prince

<i>Binary standard input</i>. This class provides methods for reading in bits from standard input, either one bit at a time (as a <tt>boolean</tt>),

Compilation: javac BinaryStdInTester.java Execution: java BinaryStdInTester % java BinaryStdInTester true K 17 12345678901 3.1415926535897

<i>Binary standard output</i>. This class provides methods for converting primtive type variables (<tt>boolean</tt>, <tt>byte</tt>, <tt>char</tt>, <

Compilation: javac BinaryStdOutTester.java Execution: java BinaryStdOutTester

Compilation: javac Bipartite.java Dependencies: Graph.java Given a graph, find either (i) a bipartition or (ii) an odd-length cycle. Runs in O(E

Compilation: javac BipartiteMatching.java Execution: java BipartiteMatching N E Dependencies: FordFulkerson.java FlowNetwork.java FlowEdge.java

Compilation: javac BlackFilter.java Execution: java BlackFilter blacklist.txt < input.txt Dependencies: SET In.java StdIn.java StdOut.java Data

Compilation: javac BoruvkaMST.java Execution: java BoruvkaMST filename.txt Dependencies: EdgeWeightedGraph.java Edge.java Bag.java

Compilation: javac BouncingBall.java Execution: java BouncingBall Dependencies: StdDraw.java Implementation of a 2-d bouncing ball in the box

Compilation: javac BoyerMoore.java Execution: java BoyerMoore pattern text Reads in two strings, the pattern and the input text, and searches

Compilation: javac BreadthFirstDirectedPaths.java Execution: java BreadthFirstDirectedPaths V E Dependencies: Digraph.java Queue.java Stack.java

Compilation: javac BreadthFirstPaths.java Execution: java BreadthFirstPaths G s Dependencies: Graph.java Queue.java Stack.java StdOut.java Data

Compilation: javac CC.java Execution: java CC filename.txt Dependencies: Graph.java StdOut.java Queue.java Data files: http://algs4.cs.prince

Compilation: javac CPM.java Execution: java CPM < input.txt Dependencies: EdgeWeightedDigraph.java AcyclicDigraphLP.java StdOut.java Data files

Compilation: javac Cat.java Execution: java Cat input0.txt input1.txt ... output.txt Dependencies: In.java Out.java Reads in text files specif

Compilation: javac Complex.java Execution: java Complex Data type for complex numbers. The data type is "immutable" so once you create and in

Compilation: javac Copy.java Execution: java Copy < file Dependencies: BinaryStdIn.java BinaryStdOut.java Reads in a binary file from standard

Compilation: javac Count.java Execution: java Count alpha < input.txt Create an alphabet specified on the command line, read in a sequence of

Compilation: javac Counter.java Execution: java Counter N T Dependencies: StdRandom.java StdOut.java A mutable data type for an integer counte

Compilation: javac Cycle.java Dependencies: Graph.java Stack.java Identifies a cycle. Runs in O(E + V) time.

Compilation: javac Date.java Execution: java Date An immutable data type for dates.

Compilation: javac DeDup.java Execution: java DeDup < input.txt Dependencies: SET StdIn.java StdOut.java Data files: http://algs4.cs.princeto

Compilation: javac DegreesOfSeparation.java Execution: java DegreesOfSeparation filename delimiter source Dependencies: SymbolGraph.java Graph.j

Compilation: javac DepthFirstDirectedPaths.java Execution: java DepthFirstDirectedPaths G s Dependencies: Digraph.java Stack.java Determine re

Compilation: javac DepthFirstOrder.java Execution: java DepthFirstOrder filename.txt Dependencies: Digraph.java Queue.java Stack.java StdOut.jav

Compilation: javac DepthFirstPaths.java Execution: java DepthFirstPaths G s Dependencies: Graph.java Stack.java StdOut.java Data files: http:

Compilation: javac DepthFirstSearch.java Execution: java DepthFirstSearch filename.txt s Dependencies: Graph.java StdOut.java Data files: htt

The <tt>Digraph</tt> class represents an directed graph of vertices named 0 through V-1. It supports the following operations: add an edge to the gr

Compilation: javac DijkstraAllPairsSP.java Dependencies: EdgeWeightedDigraph.java Dijkstra.java Dijkstra's algorithm run from each vertex. Takes

Compilation: javac DijkstraSP.java Execution: java DijkstraSP input.txt s Dependencies: EdgeWeightedDigraph.java IndexMinPQ.java Stack.java Dire

Compilation: javac DirectedCycle.java Execution: java DirectedCycle < input.txt Dependencies: Digraph.java Stack.java StdOut.java In.java Data

Compilation: javac DirectedDFS.java Execution: java DirectedDFS V E Dependencies: Digraph.java Bag.java In.java StdOut.java Data files: http:

The <tt>DirectedEdge</tt> class represents a weighted edge in an directed graph. <p> For additional documentation, see <a href="http://algs4.cs.prin

Compilation: javac DoublingRatio.java Execution: java DoublingRatio Dependencies: ThreeSum.java Stopwatch.java StdRandom.java StdOut.java % j

Compilation: javac DoublingTest.java Execution: java DoublingTest Dependencies: ThreeSum.java Stopwatch.java StdRandom.java StdOut.java % java

The <tt>Edge</tt> class represents a weighted edge in an undirected graph. <p> For additional documentation, see <a href="http://algs4.cs.princeton.

The <tt>EdgeWeightedDigraph</tt> class represents an directed graph of vertices named 0 through V-1, where each edge has a real-valued weight. It su

Compilation: javac EdgeWeightedDirectedCycle.java Execution: java EdgeWeightedDirectedCycle V E F Dependencies: EdgeWeightedDigraph.java Directe

The <tt>EdgeWeightedGraph</tt> class represents an undirected graph of vertices named 0 through V-1, where each edge has a real-valued weight. It su

Compilation: javac Evaluate.java Execution: java Evaluate Dependencies: Stack.java Evaluates (fully parenthesized) arithmetic expressions usin

Exercise 1.3.11 % java EvaluatePostfix 1 2 3 + 4 5 + 101.0 % java EvaluatePostfix 1 5 sqrt + 2.0 / 1.618033988749895 % java EvaluatePostfix

An event during a particle collision simulation. Each event contains the time at which it will occur (assuming no supervening actions) and the parti

% java Ex_1_1_32 500 0 1000000 < largeT.txt

Simulate a sequence of push and pop operations to find out whether a certain sequence of pop's can occur % java Ex_1_3_03 9 8 7 6 5 4 3 2 1 0 tru

% java Ex_1_3_04 [()]{}{[()()]()} true % java Ex_1_3_04 [(]) false

% java Ex_1_3_09 1 + 2 ) 3 - 4 ) 5 - 6 ) ) ) ( ( 1 + 2 ) ( ( 3 - 4 ) ( 5 - 6 ) ) ) % java Ex_1_3_09 sqrt 1 + 2 ) ) ( sqrt ( 1 + 2 ) )

Josephus problem % java Ex_1_3_37 7 2 1 3 5 0 4 2 6

Compilation: javac FFT.java Execution: java FFT N Dependencies: Complex.java Compute the FFT and inverse FFT of a length N complex sequence.

Compilation: javac FarthestPair.java Execution: java FarthestPair < input.txt Dependencies: GrahamScan.java Point2D.java Given a set of N poin

The <tt>FlowEdge</tt> class represents a capacitated edge with a flow in a digraph. <p> For additional documentation, see <a href="/algs4/74or">Sec

Compilation: javac FlowNetwork.java Execution: java FlowNetwork V E Dependencies: Bag.java FlowEdge.java A capacitated flow network, implement

Compilation: javac FordFulkerson.java Execution: java FordFulkerson V E Dependencies: FlowNetwork.java FlowEdge.java Queue.java Ford-Fulkerson