SYMBOL INDEX (590 symbols across 126 files)

FILE: Computational Geometry/GrahamScan.java
  class GrahamScan (line 4) | public class GrahamScan {
    method main (line 27) | public static void main(String[] args) {
    method graham (line 40) | public static Stack<int[]> graham(int[][] points){
    method polarbubblesort (line 76) | public static int[][] polarbubblesort(int[][] arr, int[] min, int[] pa...
    method angle (line 94) | public static double angle(int[] a, int[] b, int[] c){
    method dot (line 107) | public static double dot(int[] v1, int[] v2){
    method norm (line 111) | public static double norm(int[] v){
    method cross (line 115) | public static int cross(int[] v1, int[] v2){
    method d (line 119) | public static double d(int[] a, int[] b){

FILE: Computational Geometry/JarvisMarch.java
  class JarvisMarch (line 4) | public class JarvisMarch {
    method main (line 26) | public static void main(String[] args) {
    method jarvis (line 39) | public static Stack<int[]> jarvis(int[][] points){
    method angle (line 79) | public static double angle(int[] a, int[] b, int[] c){
    method dot (line 92) | public static double dot(int[] v1, int[] v2){
    method norm (line 96) | public static double norm(int[] v){
    method cross (line 100) | public static int cross(int[] v1, int[] v2){
    method d (line 104) | public static double d(int[] a, int[] b){

FILE: DP/Edit_Distance.java
  class Edit_Distance (line 3) | public class Edit_Distance {
    method main (line 22) | public static void main(String[] args) {
    method editDistanceIterative (line 37) | public static int editDistanceIterative(String a, String b){
    method editDistanceTD (line 53) | public static int editDistanceTD(String a, String b){

FILE: DP/Knapsack.java
  class Knapsack (line 4) | public class Knapsack {
    method main (line 23) | public static void main(String[] args){
    method knapsackTD (line 33) | public static int knapsackTD(int maxweight, boolean[] insert){
    method fractionalknapsack (line 45) | public static void fractionalknapsack(){

FILE: DP/LCS.java
  class LCS (line 4) | public class LCS {
    method main (line 27) | public static void main(String[] args) {
    method iterativeLCS (line 38) | public static int[] iterativeLCS(int[] a, int[] b){
    method recursiveLCS (line 69) | public static int recursiveLCS(int a, int b){

FILE: DP/maxDonations.java
  class maxDonations (line 2) | public class maxDonations {
    method main (line 22) | public static void main(String[] args) {
    method maxDonations (line 34) | public static int maxDonations(int start, int end){

FILE: Data Structures/BinaryTree.java
  class BinaryTree (line 4) | public class BinaryTree {
    method main (line 6) | public static void main(String[] args) {
    method createBinaryTree (line 23) | public static BinaryTreeNode createBinaryTree(int[] binaryTreeArray){
    method balance (line 34) | public static BinaryTreeNode balance(BinaryTreeNode tree){
    class BinaryTreeNode (line 40) | static class BinaryTreeNode{
      method BinaryTreeNode (line 45) | public BinaryTreeNode(int val){
      method toString (line 51) | public String toString(){
      method toArrayList (line 57) | public ArrayList<Integer> toArrayList(){
      method toArray (line 67) | public int[] toArray(){

FILE: Data Structures/Binary_Indexed_Tree.java
  class Binary_Indexed_Tree (line 1) | public class Binary_Indexed_Tree {
    method main (line 3) | public static void main(String[] args) throws IOException {
    class BIT (line 17) | static class BIT{
      method BIT (line 21) | public BIT(int n){
      method update (line 26) | public void update(int index, int val){
      method read (line 34) | public int read(int index){

FILE: Data Structures/Edge.java
  class Edge (line 2) | public class Edge {
    method Edge (line 11) | public Edge(int weight, int value1, int value2){
    method Edge (line 17) | public Edge(int weight, int value1, int value2, boolean directed){
    method incident (line 25) | public boolean incident(int vertex){
    method getVertex1 (line 29) | public Vertex getVertex1(){
    method getVertex2 (line 33) | public Vertex getVertex2(){
    method getWeight (line 37) | public int getWeight(){
    method getDirected (line 41) | public boolean getDirected(){
    method makeDirected (line 45) | public void makeDirected(){
    method swap (line 49) | public void swap(){
    method toString (line 55) | public String toString(){

FILE: Data Structures/Graphs.java
  class Graphs (line 2) | public class Graphs {
    method Graphs (line 9) | public Graphs(Vertex[] vertices, Edge[] edges){
    method hasVertex (line 15) | public boolean hasVertex(Vertex v){
    method getCost (line 25) | public int getCost(){
    method getEdges (line 33) | public Edge[] getEdges(){
    method vertex (line 37) | public String[] vertex(){
    method getVertices (line 45) | public Vertex[] getVertices(){
    method toString (line 49) | public String toString(){

FILE: Data Structures/Tree.java
  class Tree (line 3) | public class Tree {
    method main (line 5) | public static void main(String[] args) {
    class Node (line 12) | public static class Node<T> {
      method Node (line 17) | public Node(T data) {
      method Node (line 21) | public Node(T data, Node<T> parent) {
      method getChildren (line 26) | public List<Node<T>> getChildren() {
      method setParent (line 30) | public void setParent(Node<T> parent) {
      method add (line 35) | public void add(T data) {
      method add (line 41) | public void add(Node<T> child) {
      method data (line 46) | public T data() {
      method setData (line 50) | public void setData(T data) {
      method isRoot (line 54) | public boolean isRoot() {
      method isLeaf (line 58) | public boolean isLeaf() {
      method removeParent (line 62) | public void removeParent() {
    class Graph (line 68) | public class Graph {
      method Graph (line 73) | public Graph(Vertex[] vertices, Edge[] edges){
      method hasVertex (line 79) | public boolean hasVertex(Vertex v){
      method getCost (line 89) | public int getCost(){
      method getEdges (line 97) | public Edge[] getEdges(){
      method vertex (line 101) | public String[] vertex(){
      method getVertices (line 109) | public Vertex[] getVertices(){
      method toString (line 113) | public String toString(){
    class Edge (line 131) | public class Edge {
      method Edge (line 138) | public Edge(int weight, int value1, int value2){
      method Edge (line 144) | public Edge(int weight, int value1, int value2, boolean directed){
      method incident (line 152) | public boolean incident(int vertex){
      method getVertex1 (line 156) | public Vertex getVertex1(){
      method getVertex2 (line 160) | public Vertex getVertex2(){
      method getWeight (line 164) | public int getWeight(){
      method getDirected (line 168) | public boolean getDirected(){
      method makeDirected (line 172) | public void makeDirected(){
      method swap (line 176) | public void swap(){
      method toString (line 182) | public String toString(){
    class Vertex (line 189) | public class Vertex {
      method Vertex (line 192) | public Vertex(int val){
      method getValue (line 196) | public int getValue(){
      method toString (line 200) | public String toString(){

FILE: Data Structures/Vertex.java
  class Vertex (line 1) | static class Vertex{
    method Vertex (line 5) | public Vertex(int name, int distance){
    method toString (line 10) | public String toString(){

FILE: GoogleCodeJam/ABBA.java
  class ABBA (line 2) | public class ABBA {
    method main (line 3) | public static void main(String[] args) throws Exception{
    method canObtain (line 11) | public static String canObtain(String initial, String target){

FILE: GoogleCodeJam/Alphabet_Cake.java
  class Alphabet_Cake (line 8) | public class Alphabet_Cake {
    method main (line 14) | public static void main(String[] args) throws Exception{
    method print (line 79) | public static <T> void print(T t){
    class Scan (line 84) | static class Scan{
      method Scan (line 88) | public Scan(String file) throws IOException{
      method next (line 93) | String next(){
      method nextInt (line 105) | int nextInt(){
      method nextLong (line 109) | long nextLong(){
      method nextDouble (line 113) | double nextDouble(){
      method nextLine (line 117) | String nextLine(){

FILE: GoogleCodeJam/BFCalculator.java
  class BFCalculator (line 2) | public class BFCalculator {
    method main (line 4) | public static void main(String[] args) {

FILE: GoogleCodeJam/Bathroom_Stalls.java
  class Bathroom_Stalls (line 6) | public class Bathroom_Stalls {
    method main (line 8) | public static void main(String[] args) throws Exception{

FILE: GoogleCodeJam/Close_Match.java
  class Close_Match (line 7) | public class Close_Match {
    method main (line 9) | public static void main(String[] args) throws Exception{

FILE: GoogleCodeJam/Coin_Jam.java
  class Coin_Jam (line 5) | public class Coin_Jam {
    method main (line 7) | public static void main(String[] args) throws Exception{
    method convert (line 45) | public static int convert(String s, int base){
    method out (line 58) | public static int[] out(String s){
    method isDiv (line 74) | public static boolean isDiv(String n){
    method divisors (line 90) | public static String divisors(String n){
    method binary_convert (line 105) | public static String binary_convert(int n, int len){
    method convertss (line 121) | public static int convertss(String s, int base){
    method gen_bin_array (line 132) | public static String[] gen_bin_array(int len){

FILE: GoogleCodeJam/Counting_Sheep.java
  class Counting_Sheep (line 4) | public class Counting_Sheep {
    method main (line 6) | public static void main(String[] args) throws Exception{

FILE: GoogleCodeJam/CrossOver.java
  class CrossOver (line 3) | public class CrossOver {
    method main (line 5) | public static void main(String[] args) throws Exception{

FILE: GoogleCodeJam/Digits.java
  class Digits (line 9) | public class Digits {
    method main (line 11) | public static void main(String[] args) throws Exception{

FILE: GoogleCodeJam/Oversized_Pancake_Flipper.java
  class Oversized_Pancake_Flipper (line 4) | public class Oversized_Pancake_Flipper {
    method main (line 6) | public static void main(String[] args) throws Exception{
    method flip (line 77) | public static boolean[] flip(int start, int size, boolean[] pancakes){
    method indexOf (line 83) | public static int indexOf(boolean[] pancake, boolean element){

FILE: GoogleCodeJam/Pancakes.java
  class Pancakes (line 4) | public class Pancakes {
    method main (line 6) | public static void main(String[] args) throws Exception{

FILE: GoogleCodeJam/Prison_Break.java
  class Prison_Break (line 4) | public class Prison_Break {
    method main (line 6) | public static void main(String[] args) throws Exception{

FILE: GoogleCodeJam/Solution.java
  class Solution (line 7) | public class Solution {
    method prison (line 9) | static long prison(int n, int m, int[] h, int[] v) {
    method main (line 64) | public static void main(String[] args) throws IOException{

FILE: GoogleCodeJam/Super_Substrings.java
  class Super_Substrings (line 4) | public class Super_Substrings {
    method main (line 6) | public static void main(String[] args) throws Exception{
    method sum (line 26) | public static int sum(int num){

FILE: GoogleCodeJam/Tidy_Numbers.java
  class Tidy_Numbers (line 4) | public class Tidy_Numbers {
    method main (line 6) | public static void main(String[] args) throws Exception {
    method isTidy (line 49) | public static int isTidy(long n){
    method nines (line 60) | public static String nines(String n){

FILE: Graph/BFS.java
  class BFS (line 27) | public class BFS {
    method main (line 52) | public static void main(String[] args) {
    method QueueBFSList (line 80) | public static ArrayList<Integer> QueueBFSList(ArrayList<ArrayList<Inte...
    method IterativeBFSList (line 102) | public static ArrayList<Integer> IterativeBFSList(ArrayList<ArrayList<...
    method QueueBFSMatrix (line 124) | public static ArrayList<Integer> QueueBFSMatrix(boolean[][] adjmat, in...
    method IterativeBFSMatrix (line 146) | public static ArrayList<Integer> IterativeBFSMatrix(boolean[][] adjmat...
    method mat2list (line 169) | public static ArrayList<ArrayList<Integer>> mat2list(boolean[][] adj){
    method list2mat (line 183) | public static boolean[][] list2mat(ArrayList<ArrayList<Integer>> adjli...
    method display (line 195) | public static void display(boolean[][] adj, String name){

FILE: Graph/Bellman_Ford.java
  class Bellman_Ford (line 22) | public class Bellman_Ford {
    method main (line 41) | public static void main(String[] args) {
    method bellman_ford (line 68) | public static int bellman_ford(ArrayList<Vertex>[] adjlist, int source...
    method display (line 96) | public static void display(boolean[][] adj, String name){
    class Vertex (line 156) | static class Vertex{
      method Vertex (line 160) | public Vertex(int val){
      method Vertex (line 164) | public Vertex(int val, int weight){
      method toString (line 170) | public String toString(){
    method list2arr (line 175) | public static int[] list2arr(ArrayList<Integer> list){
    method list2arr (line 179) | public static ArrayList<Integer> list2arr(int[] arr){

FILE: Graph/DFS.java
  class DFS (line 27) | public class DFS {
    method main (line 48) | public static void main(String[] args) {
    method iterativeDFS (line 76) | public static ArrayList<Integer> iterativeDFS(ArrayList<ArrayList<Inte...
    method recursiveDFS (line 98) | public static void recursiveDFS(ArrayList<ArrayList<Integer>> adjlist,...
    method mat2list (line 109) | public static ArrayList<ArrayList<Integer>> mat2list(boolean[][] adj){
    method list2mat (line 123) | public static boolean[][] list2mat(ArrayList<ArrayList<Integer>> adjli...
    method display (line 134) | public static void display(boolean[][] adj, String name){

FILE: Graph/Dijkstra.java
  class Dijkstra (line 22) | public class Dijkstra {
    method main (line 45) | public static void main(String[] args) {
    method dijkstra (line 90) | public static ArrayList<Integer> dijkstra(ArrayList<Vertex>[] adjlist,...
    method display (line 126) | public static void display(boolean[][] adj, String name){
    class Vertex (line 186) | static class Vertex implements Comparable<Vertex>{
      method Vertex (line 190) | public Vertex(int name){
      method Vertex (line 194) | public Vertex(int name, int val){
      method toString (line 200) | public String toString(){
      method compareTo (line 204) | public int compareTo(Vertex v){
    method list2arr (line 209) | public static int[] list2arr(ArrayList<Integer> list){
    method list2arr (line 213) | public static ArrayList<Integer> list2arr(int[] arr){

FILE: Graph/Edge.java
  class Edge (line 2) | public class Edge {
    method Edge (line 11) | public Edge(int weight, int value1, int value2){
    method Edge (line 17) | public Edge(int weight, int value1, int value2, boolean directed){
    method incident (line 25) | public boolean incident(int vertex){
    method getVertex1 (line 29) | public Vertex getVertex1(){
    method getVertex2 (line 33) | public Vertex getVertex2(){
    method getWeight (line 37) | public int getWeight(){
    method getDirected (line 41) | public boolean getDirected(){
    method makeDirected (line 45) | public void makeDirected(){
    method swap (line 49) | public void swap(){
    method toString (line 55) | public String toString(){

FILE: Graph/Floyd_Warshall.java
  class Floyd_Warshall (line 22) | public class Floyd_Warshall {
    method main (line 45) | public static void main(String[] args) {
    method floyd_warshall (line 72) | public static ArrayList<Integer> floyd_warshall(ArrayList<Vertex>[] ad...
    method display (line 107) | public static void display(boolean[][] adj, String name){
    class Vertex (line 167) | static class Vertex{
      method Vertex (line 171) | public Vertex(int name){
      method Vertex (line 175) | public Vertex(int name, int val){
      method toString (line 181) | public String toString(){
    method list2arr (line 186) | public static int[] list2arr(ArrayList<Integer> list){
    method list2arr (line 190) | public static ArrayList<Integer> list2arr(int[] arr){

FILE: Graph/Ford_Fulkerson.java
  class Ford_Fulkerson (line 23) | public class Ford_Fulkerson {
    method main (line 43) | public static void main(String[] args){
    method bfs (line 93) | public static int[] bfs(int[][] residual)
    method dfs (line 123) | public static ArrayList<Integer> dfs(int[][] residual){
    method residual (line 154) | public static int[][] residual(int[][] network, int[][] flow){
    method display (line 172) | public static void display(int[][] adj, String name){

FILE: Graph/Graph_Traversal.java
  class Graph_Traversal (line 23) | public class Graph_Traversal {
    method main (line 27) | public static void main(String[] args) {
    method iterativeDFS (line 106) | public static ArrayList<Integer> iterativeDFS(ArrayList<ArrayList<Inte...
    method recursiveDFS (line 128) | public static void recursiveDFS(ArrayList<ArrayList<Integer>> adjlist,...
    method bfs (line 139) | public static ArrayList<Integer> bfs(ArrayList<ArrayList<Integer>> adj...
    method BFS (line 161) | public static ArrayList<Integer> BFS(ArrayList<ArrayList<Integer>> adj...
    method bfsmatrix (line 183) | public static ArrayList<Integer> bfsmatrix(boolean[][] adjmat, int sou...
    method BFSmatrix (line 205) | public static ArrayList<Integer> BFSmatrix(boolean[][] adjmat, int sou...
    method mat2list (line 230) | public static ArrayList<ArrayList<Integer>> mat2list(boolean[][] adj){
    method list2mat (line 244) | public static boolean[][] list2mat(ArrayList<ArrayList<Integer>> adjli...
    method display (line 256) | public static void display(boolean[][] adj, String name){
    method execute (line 316) | public static <T> void execute(T t, long start){

FILE: Graph/Graphs.java
  class Graphs (line 2) | public class Graphs {
    method Graphs (line 9) | public Graphs(Vertex[] vertices, Edge[] edges){
    method hasVertex (line 15) | public boolean hasVertex(Vertex v){
    method getCost (line 25) | public int getCost(){
    method getEdges (line 33) | public Edge[] getEdges(){
    method vertex (line 37) | public String[] vertex(){
    method getVertices (line 45) | public Vertex[] getVertices(){
    method toString (line 49) | public String toString(){

FILE: Graph/Karger.java
  class Karger (line 15) | public class Karger {
    method main (line 38) | public static void main(String[] args) {
    method edgeContraction (line 64) | public static int[][] edgeContraction(int[][] edges){
    method newVertices (line 95) | public static int[] newVertices(int[] vertices, int[][] edges){
    method convertGraph (line 115) | public static Graph<Integer, Integer> convertGraph(int[] vertices, int...
    method display (line 128) | public static void display(int[] vertices, int[][] edges, String color...

FILE: Graph/Prim.java
  class Prim (line 19) | public class Prim extends JPanel{
    method main (line 47) | public static void main(String[] args) {
    method adjacentEdges (line 96) | public static Edge[] adjacentEdges(Graphs mst, Graphs g){
    method contains (line 110) | public static boolean contains(Vertex[] vertices, Vertex v){
    method minEdge (line 120) | public static Edge minEdge(Edge[] edges){
    method addVertex (line 131) | public static Graphs addVertex(Graphs g, Vertex vertex){
    method addEdge (line 142) | public static Graphs addEdge(Graphs g, Edge edge){
    method convertVertices (line 153) | public static Vertex[] convertVertices(int[] values){
    method convertEdges (line 162) | public static Edge[] convertEdges(int[][] lengths){
    method convertGraph (line 172) | public static Graph<Integer, Integer> convertGraph(Graphs g){
    method display (line 190) | public static void display(Graphs graph, String color, String name){

FILE: Graph/Vertex.java
  class Vertex (line 2) | public class Vertex {
    method Vertex (line 9) | public Vertex(int val){
    method getValue (line 13) | public int getValue(){
    method toString (line 17) | public String toString(){

FILE: Miscellaneous/Fisher_Yates.java
  class Fisher_Yates (line 4) | public class Fisher_Yates {
    method main (line 25) | public static void main(String[] args) {
    method shuffle (line 32) | public static <E extends Comparable<E>> E[] shuffle(E[] arr){
    method swap (line 41) | public static <E> void swap(E[] arr, int i, int j){

FILE: Miscellaneous/Matrix_Exponentiation.java
  class Matrix_Exponentiation (line 3) | public class Matrix_Exponentiation {
    method main (line 23) | public static void main(String[] args){
    method matrix_multiply (line 42) | public static int[][] matrix_multiply(int[][] a, int[][] b){
    method matrix_exponentiation (line 58) | public static int[][] matrix_exponentiation(int[][] m, int n){

FILE: Miscellaneous/Subarray_Inversions.java
  class Subarray_Inversions (line 3) | public class Subarray_Inversions {
    method inversionCountBIT1 (line 32) | static long inversionCountBIT1(int[] arr, int start, int end) {
    method inversionCountBIT2 (line 43) | static long inversionCountBIT2(int[] arr, int start, int end, long val) {
    method inversionCount (line 54) | public static long inversionCount(int n, int k, int[] arr){
    method main (line 91) | public static void main(String[] args)throws Exception {
    class BIT (line 101) | static class BIT
      method BIT (line 105) | public BIT(int N){
      method update (line 111) | void update(int index, int val){
      method read (line 119) | int read(int index)

FILE: Optimization/LightConfigurationOptimization.java
  class LightConfigurationOptimization (line 5) | public class LightConfigurationOptimization {
    method main (line 14) | public static void main(String[] rip){
    method cost (line 46) | public static LEDConfiguration cost(int[] LEDarr){
    method irradiance (line 82) | public static double irradiance(int LED, int[] pointcoord){
    method indexToPoints (line 89) | public static int[] indexToPoints(int index){
    class LEDConfiguration (line 94) | static class LEDConfiguration{
      method LEDConfiguration (line 97) | public LEDConfiguration(double CVRMSE, int[] LEDarray){

FILE: Optimization/LightConfigurationOptimizationSA.java
  class LightConfigurationOptimizationSA (line 5) | public class LightConfigurationOptimizationSA {
    method main (line 19) | public static void main(String[] args) {
    method neighbor (line 57) | public static Solution neighbor(Solution currentSol){
    method genRandSol (line 69) | public static Solution genRandSol(){
    method irradiance (line 85) | public static double irradiance(int LED, int[] pointcoord){
    method indexToPoints (line 92) | public static int[] indexToPoints(int index){
    method cost (line 99) | public static double cost(int[] LEDarr){
    class Solution (line 129) | static class Solution{
      method Solution (line 132) | public Solution(double CVRMSE, int[] configuration){

FILE: Optimization/LocationalOptimizationIterative.java
  class LocationalOptimizationIterative (line 5) | public class LocationalOptimizationIterative {
    method main (line 13) | public static void main(String[] rip){
    method irradiance (line 75) | public static double irradiance(int LED, int[] pointcoord){
    method indexToPoints (line 82) | public static int[] indexToPoints(int index){

FILE: ProjectEuler/Amicable_numbers.java
  class Amicable_numbers (line 2) | public class Amicable_numbers {
    method main (line 4) | public static void main(String[] args) {
    method amicable (line 15) | public static boolean amicable(int a, int b){
    method sum_divisors (line 19) | public static int sum_divisors(int n){

FILE: ProjectEuler/Coded_triangle_numbers.java
  class Coded_triangle_numbers (line 7) | public class Coded_triangle_numbers {
    method main (line 9) | public static void main(String[] args) throws IOException{

FILE: ProjectEuler/Collatz_sequence.java
  class Collatz_sequence (line 2) | public class Collatz_sequence {
    method main (line 3) | public static void main(String[] args){
    method collatz (line 17) | public static double collatz(double n){

FILE: ProjectEuler/Combinatoric_selections.java
  class Combinatoric_selections (line 3) | public class Combinatoric_selections {
    method main (line 5) | public static void main(String[] args) {
    method factorial (line 19) | public static int factorial(int num){

FILE: ProjectEuler/Concealed_square.java
  class Concealed_square (line 3) | public class Concealed_square {
    method main (line 5) | public static void main(String[] args) {

FILE: ProjectEuler/Consecutive_distinct_prime_factors.java
  class Consecutive_distinct_prime_factors (line 4) | public class Consecutive_distinct_prime_factors {
    method main (line 6) | public static void main(String[] args) {
    method factor (line 19) | public static ArrayList<Double> factor(double n){
    method inlist (line 31) | public static boolean inlist(double n, ArrayList<Double> arr){
    method return_max (line 40) | public static double return_max(ArrayList<Double> factors){
    method isPrime (line 50) | public static boolean isPrime(double n){

FILE: ProjectEuler/Counting_sundays.java
  class Counting_sundays (line 2) | public class Counting_sundays {
    method main (line 4) | public static void main(String[] args) {

FILE: ProjectEuler/Digit_factorials.java
  class Digit_factorials (line 2) | public class Digit_factorials {
    method main (line 4) | public static void main(String[] args) {
    method factorial (line 14) | public static int factorial(int num){
    method sumDigits (line 22) | public static boolean sumDigits(int n){

FILE: ProjectEuler/Digit_fifth_power.java
  class Digit_fifth_power (line 2) | public class Digit_fifth_power {
    method main (line 4) | public static void main(String[] args) {
    method digits (line 15) | public static int[] digits(int n){
    method fifth_power (line 24) | public static boolean fifth_power(int n){

FILE: ProjectEuler/Distinct_powers.java
  class Distinct_powers (line 4) | public class Distinct_powers {
    method main (line 6) | public static void main(String[] args) {

FILE: ProjectEuler/Even_fibonacci_sum.java
  class Even_fibonacci_sum (line 3) | public class Even_fibonacci_sum {
    method main (line 5) | public static void main(String[] args) {

FILE: ProjectEuler/Factorial_digit_sum.java
  class Factorial_digit_sum (line 3) | public class Factorial_digit_sum {
    method main (line 5) | public static void main(String[] args) {
    method factorial (line 9) | public static BigInteger factorial(int num){
    method sum_digits (line 16) | public static double sum_digits(BigInteger n){

FILE: ProjectEuler/Grid_product_maximum.java
  class Grid_product_maximum (line 3) | public class Grid_product_maximum {
    method main (line 5) | public static void main(String[] args) {
    method max_prod_horizontal (line 39) | public static int max_prod_horizontal(int[][] grid){
    method max_prod_vertical (line 49) | public static int max_prod_vertical(int[][] grid){
    method max_prod_diagonal_right (line 59) | public static int max_prod_diagonal_right(int[][] grid){
    method max_prod_diagonal_left (line 69) | public static int max_prod_diagonal_left(int[][] grid){

FILE: ProjectEuler/Highly_divisible_triangular.java
  class Highly_divisible_triangular (line 3) | public class Highly_divisible_triangular {
    method main (line 5) | public static void main(String[] args) {
    method num_divisors (line 18) | public static int num_divisors(int n){

FILE: ProjectEuler/Large_sum.java
  class Large_sum (line 2) | public class Large_sum {
    method main (line 4) | public static void main(String[] args) {

FILE: ProjectEuler/Largest_consecutive_product.java
  class Largest_consecutive_product (line 2) | public class Largest_consecutive_product {
    method main (line 4) | public static void main(String[] args) {
    method prod (line 15) | public static int prod(String n){

FILE: ProjectEuler/Lexicogrphic_permutations.java
  class Lexicogrphic_permutations (line 4) | public class Lexicogrphic_permutations {
    method main (line 6) | public static void main(String[] args) {
    method sort (line 12) | public static void sort(ArrayList<Integer> perms){
    method swap (line 20) | public static void swap(ArrayList<Integer> arr, int index_a, int index...
    method find_min (line 26) | public static int find_min(ArrayList<Integer> arr, int start_index){

FILE: ProjectEuler/MATH_TOOLBOX.java
  type MATH_TOOLBOX (line 5) | public interface MATH_TOOLBOX {
    method run (line 6) | public int run(int a, int b);
  class factorial (line 10) | class factorial implements MATH_TOOLBOX{
    method run (line 11) | public int run(int n, int x){
  class sum_digits_square (line 20) | class sum_digits_square implements MATH_TOOLBOX{
    method run (line 21) | public int run(int i, int x){
  class main (line 31) | class main{
    method main (line 32) | public static void main(String[] args){

FILE: ProjectEuler/Names_scores.java
  class Names_scores (line 5) | public class Names_scores {
    method main (line 7) | public static void main(String[] args) {

FILE: ProjectEuler/Nontrivial_digit_cancelling_fractions.java
  class Nontrivial_digit_cancelling_fractions (line 2) | public class Nontrivial_digit_cancelling_fractions {
    method main (line 4) | public static void main(String[] args) {
    method cancelling (line 9) | public static boolean cancelling(int n, int d){

FILE: ProjectEuler/Nth_digit_powers.java
  class Nth_digit_powers (line 5) | public class Nth_digit_powers {
    method main (line 7) | public static void main(String[] args) {

FILE: ProjectEuler/Number_letter_counts.java
  class Number_letter_counts (line 2) | public class Number_letter_counts {
    method main (line 4) | public static void main(String[] args) {

FILE: ProjectEuler/PLAYGROUND.java
  class PLAYGROUND (line 6) | @SuppressWarnings("unused")
    method main (line 12) | @SuppressWarnings("resource")
    method removeDuplicates (line 19) | public static ArrayList<String> removeDuplicates(ArrayList<String> lis...
    method indexOf (line 31) | public static int indexOf(int element, int[] arr){
    method cycle (line 40) | public static int cycle(int i, int[] temp){
    method factorial2 (line 47) | public static BigInteger factorial2(int num){
    method factorial (line 56) | public static int factorial(int num){
    method sum_digits_square (line 66) | public static int sum_digits_square(int i){
    method triangle_word (line 78) | public static boolean triangle_word(String n){
    method num_divisors (line 92) | public static int num_divisors(int n){
    method primes (line 102) | public static ArrayList<Integer> primes(int a, int b){
    method isPrime (line 112) | public static boolean isPrime(int n){
    method amicable (line 122) | public static boolean amicable(int a, int b){
    method sum_divisors (line 126) | public static int sum_divisors(int n){

FILE: ProjectEuler/Pandigital_prime.java
  class Pandigital_prime (line 4) | public class Pandigital_prime {
    method main (line 6) | public static void main(String[] args) {
    method pandigital (line 19) | public static boolean pandigital(int n){
    method isPrime (line 29) | public static boolean isPrime(int n){

FILE: ProjectEuler/Permuted_multiples.java
  class Permuted_multiples (line 3) | public class Permuted_multiples {
    method main (line 5) | public static void main(String[] args) {
    method same_digits (line 20) | public static boolean same_digits(int a, int b){

FILE: ProjectEuler/Prime_Summation.java
  class Prime_Summation (line 3) | public class Prime_Summation {
    method main (line 5) | public static void main(String[] args) {
    method isPrime (line 17) | public static boolean isPrime(double n){

FILE: ProjectEuler/Prime_factorization.java
  class Prime_factorization (line 3) | public class Prime_factorization {
    method main (line 5) | public static void main(String[] args) {
    method factor (line 11) | public static ArrayList<Double> factor(double n){
    method return_max (line 24) | public static double return_max(ArrayList<Double> factors){
    method isPrime (line 34) | public static boolean isPrime(double n){

FILE: ProjectEuler/Pythagorean_triplet.java
  class Pythagorean_triplet (line 2) | public class Pythagorean_triplet {
    method main (line 4) | public static void main(String[] args) {

FILE: ProjectEuler/Reverse_message.java
  class Reverse_message (line 3) | public class Reverse_message{
    method main (line 4) | public static void main(String[] args){
    method reverse_words (line 7) | public static String reverse_words(String message){

FILE: ProjectEuler/Smallest_multiple.java
  class Smallest_multiple (line 2) | public class Smallest_multiple {
    method main (line 4) | public static void main(String[] args) {

FILE: ProjectEuler/Square_digit_chains.java
  class Square_digit_chains (line 3) | public class Square_digit_chains {
    method main (line 5) | public static void main(String[] args) {
    method sum_digits_square (line 25) | public static int sum_digits_square(int n){

FILE: ProjectEuler/Thousand_digit_fibonacci.java
  class Thousand_digit_fibonacci (line 4) | public class Thousand_digit_fibonacci {
    method main (line 6) | public static void main(String[] args) {

FILE: ProjectEuler/Totient_maximum.java
  class Totient_maximum (line 2) | public class Totient_maximum {
    method main (line 4) | public static void main(String[] args) {
    method gcd (line 18) | public static double gcd(double a, double b){
    method totient (line 22) | public static double totient(double n){

FILE: ProjectEuler/Totient_permutations.java
  class Totient_permutations (line 2) | public class Totient_permutations {
    method main (line 4) | public static void main(String[] args) {
    method gcd (line 18) | public static double gcd(double a, double b){
    method totient (line 22) | public static double totient(double n){
    method same_digits (line 32) | public static boolean same_digits(double a, double b){

FILE: ProjectEuler/primes.java
  class primes (line 2) | public class primes{
    method main (line 3) | public static void main(String[] args){
    method factor (line 15) | public static List<Integer> factor(int n){
    method isPrime (line 26) | public static boolean isPrime(int n){

FILE: Sorting/Bogosort.java
  class Bogosort (line 4) | public class Bogosort {
    method main (line 27) | public static void main(String[] args) {
    method sorted (line 35) | public static <E extends Comparable<E>> boolean sorted(E[] arr){
    method bogosort (line 43) | public static <E extends Comparable<E>> E[] bogosort(E[] arr){
    method shuffle (line 51) | public static <E extends Comparable<E>> E[] shuffle(E[] arr){
    method swap (line 60) | public static <E> void swap(E[] arr, int i, int j){

FILE: Sorting/Bubble_Sort.java
  class Bubble_Sort (line 3) | public class Bubble_Sort {
    method main (line 20) | public static void main(String[] args) {
    method bubblesort (line 32) | public static <E extends Comparable<E>> E[] bubblesort(E[] arr){

FILE: Sorting/Counting_Sort.java
  class Counting_Sort (line 3) | public class Counting_Sort {
    method main (line 20) | public static void main(String[] args) {
    method countingsort (line 29) | public static int[] countingsort(int[] arr, int...max){

FILE: Sorting/Heapsort.java
  class Heapsort (line 3) | public class Heapsort {
    method main (line 24) | public static void main(String[] args) {
    method heapsort (line 35) | public static <E extends Comparable<E>> E[] heapsort(E[] arr){
    method maxheapify (line 53) | public static <E extends Comparable<E>> E[] maxheapify(E[] arr, Intege...

FILE: Sorting/Insertion_Sort.java
  class Insertion_Sort (line 3) | public class Insertion_Sort {
    method main (line 20) | public static void main(String[] args) {
    method insertionsort (line 32) | public static <E extends Comparable<E>> E[] insertionsort(E[] arr){

FILE: Sorting/Mergesort.java
  class Mergesort (line 3) | public class Mergesort {
    method main (line 23) | public static void main(String[] args) {
    method mergesort (line 32) | public static int[] mergesort(int[] arr){

FILE: Sorting/Quicksort.java
  class Quicksort (line 3) | public class Quicksort {
    method main (line 24) | public static void main(String[] args) {
    method quicksort (line 35) | public static <E extends Comparable<E>> E[] quicksort(E[] arr, int...r...

FILE: Sorting/Radix_Sort.java
  class Radix_Sort (line 3) | public class Radix_Sort {
    method main (line 25) | public static void main(String[] args) {
    method radixsort (line 34) | public static int[] radixsort(int[] arr, int...maximum){

FILE: Sorting/Selection_Sort.java
  class Selection_Sort (line 3) | public class Selection_Sort {
    method main (line 20) | public static void main(String[] args) {
    method selectionsort (line 32) | public static <E extends Comparable<E>> E[] selectionsort(E[] arr){

FILE: Sorting/Sorting.java
  class Sorting (line 4) | public class Sorting {
    method main (line 13) | public static void main(String[] args) {
    method getMax (line 77) | public static int getMax(int[] arr){
    method bucketsort (line 84) | public static int[] bucketsort(int[] arr){
    method radixsort (line 90) | public static int[] radixsort(int[] arr, int...maximum){
    method countingsort (line 122) | public static int[] countingsort(int[] arr, int...max){
    method quicksort (line 167) | public static int[] quicksort(int[] arr, int...range){
    method heapsort (line 197) | public static int[] heapsort(int[] arr){
    method maxheapify (line 214) | public static int[] maxheapify(int[] arr, int node, int heaplength){
    method mergesort (line 237) | public static int[] mergesort(int[] arr){
    method insertionsort (line 273) | public static int[] insertionsort(int[] arr){
    method bubblesort (line 295) | public static int[] bubblesort(int[] arr){
    method selectionsort (line 310) | public static int[] selectionsort(int[] arr){

FILE: Sorting/Timsort.java
  class Timsort (line 3) | public class Timsort {
    method main (line 19) | public static void main(String[] args){

FILE: Strings/Boyer_Moore.java
  class Boyer_Moore (line 4) | public class Boyer_Moore {
    method main (line 24) | public static void main(String[] args) { long start=System.nanoTime();
    method boyer_moore (line 37) | public static int boyer_moore(String pat, String txt) {

FILE: Strings/KMP.java
  class KMP (line 5) | public class KMP {
    method main (line 28) | public static void main(String[] args) throws FileNotFoundException { ...
    method kmpIterative (line 43) | public static boolean kmpIterative(String pattern, String text){
    method kmpDFA (line 76) | public static int kmpDFA(String pat, String txt) {
    method longest_prefix_suffix (line 99) | public static int longest_prefix_suffix(String str){

FILE: Strings/Naive_String_Searching.java
  class Naive_String_Searching (line 6) | public class Naive_String_Searching {
    method main (line 25) | public static void main(String[] args) throws Exception{
    method naive (line 37) | public static boolean naive(String pat, String txt){

FILE: Strings/Rabin_Karp.java
  class Rabin_Karp (line 5) | public class Rabin_Karp {
    method main (line 25) | public static void main(String[] args) { long start=System.nanoTime();
    method hash (line 33) | private static long hash(String key, int m, long q) {
    method check (line 40) | private static boolean check(String pat, String txt, int i, int m) {
    method rabin_karp (line 47) | public static int rabin_karp(String pat, String txt) {

FILE: Strings/String_Algorithms.java
  class String_Algorithms (line 8) | public class String_Algorithms {
    method main (line 18) | public static void main(String[] args) throws FileNotFoundException {
    method boyer_moore (line 49) | public static int boyer_moore(String pat, String txt) {
    method kmp (line 73) | public static int kmp(String pat, String txt) {
    method hash (line 94) | private static long hash(String key, int m, long q) {
    method check (line 101) | private static boolean check(String pat, String txt, int i, int m) {
    method rabin_karp (line 108) | public static int rabin_karp(String pat, String txt) {

FILE: USACO/AngryCows.java
  class AngryCows (line 4) | public class AngryCows {
    method main (line 6) | public static void main(String[] args) throws Exception {
    method exists (line 48) | public static int exists(int a, int b, ArrayList<Integer> arr){
    method first (line 58) | public static int first(int a, int b, ArrayList<Integer> arr){
    method last (line 68) | public static int last(int a, int b, ArrayList<Integer> arr){
    method explode (line 78) | public static void explode(int a, int b, ArrayList<Integer> arr){

FILE: USACO/AngryCows2.java
  class AngryCows2 (line 4) | public class AngryCows2 {
    method main (line 6) | public static void main(String[] args) throws Exception{
    method explode (line 35) | public static void explode(int a, int b, ArrayList<Integer> arr){

FILE: USACO/BovineGenomics.java
  class BovineGenomics (line 7) | public class BovineGenomics {
    method main (line 9) | public static void main(String[] args) throws Exception{
    method disjoint (line 53) | public static boolean disjoint(String[] spotarr, String[] plainarr, in...

FILE: USACO/BovineGenomics_bruteforce.java
  class BovineGenomics_bruteforce (line 6) | public class BovineGenomics_bruteforce {
    method main (line 8) | public static void main(String[] args) throws Exception{
    method disjoint (line 49) | public static boolean disjoint(String[] spotarr, String[] plainarr, in...

FILE: USACO/BuildGates.java
  class BuildGates (line 8) | public class BuildGates {
    method main (line 9) | public static void main(String[] args) throws Exception{

FILE: USACO/CircularBarn.java
  class CircularBarn (line 2) | public class CircularBarn {
    method main (line 4) | public static void main(String[] args) {

FILE: USACO/CowCode.java
  class CowCode (line 4) | public class CowCode {
    method main (line 6) | public static void main(String[] args) throws Exception {
    method f (line 21) | public static String f(long n, String word){

FILE: USACO/CowDanceShow.java
  class CowDanceShow (line 4) | public class CowDanceShow {
    method main (line 13) | public static void main(String[] args) throws Exception {
    method time (line 56) | public static int time(int k){
    method maxval (line 81) | public static int maxval(int[] stage){
    method min (line 93) | public static int min(int[] stage){

FILE: USACO/CowTip.java
  class CowTip (line 4) | public class CowTip {
    method main (line 6) | public static void main(String[] args) throws Exception {
    method tipped (line 40) | public static int tipped(int[][] farm){
    method invert (line 52) | public static int[][] invert(int[][] farm, int row, int col){
    method maxTipped (line 61) | public static int[] maxTipped(int[][] farm){

FILE: USACO/FencePainting.java
  class FencePainting (line 4) | public class FencePainting {
    method main (line 6) | public static void main(String[] args) throws Exception {

FILE: USACO/HPS.java
  class HPS (line 4) | public class HPS {
    method main (line 6) | public static void main(String[] args) throws Exception {
    method greater (line 74) | public static boolean greater(int a, int b, int rock, int paper, int s...

FILE: USACO/Haybales.java
  class Haybales (line 9) | public class Haybales {
    method main (line 11) | public static void main(String[] args) throws Exception{
    method floorIndex (line 54) | public static int floorIndex(List<Integer> haybales, int query){
    method ceilIndex (line 63) | public static int ceilIndex(List<Integer> haybales, int query){

FILE: USACO/HoofPaperScissors.java
  class HoofPaperScissors (line 4) | public class HoofPaperScissors {
    method main (line 6) | public static void main(String[] args) throws Exception {
    method numRepeats (line 39) | public static int[] numRepeats(int[] arr){

FILE: USACO/LoadBalancing.java
  class LoadBalancing (line 5) | public class LoadBalancing {
    method main (line 7) | public static void main(String[] args) throws Exception{
    method max_points (line 43) | public static int max_points(int x, int y, ArrayList<int[]> points){

FILE: USACO/MilkPails.java
  class MilkPails (line 4) | public class MilkPails {
    method main (line 6) | public static void main(String[] args) throws Exception {
    method min (line 38) | public static int min(ArrayList<Integer> n){

FILE: USACO/ModernArt.java
  class ModernArt (line 6) | public class ModernArt {
    method main (line 8) | public static void main(String[] args) throws Exception{
    method removeTopLayer (line 41) | public static int[][] removeTopLayer(int[][] paint){

FILE: USACO/ModernArt2.java
  class ModernArt2 (line 8) | public class ModernArt2 {
    method main (line 10) | public static void main(String[] args) throws Exception{
    method layers (line 29) | public static int layers(int[] paint){

FILE: USACO/ModernArt2_bruteforce.java
  class ModernArt2_bruteforce (line 7) | public class ModernArt2_bruteforce {
    method main (line 9) | public static void main(String[] args) throws Exception{
    method consecutive (line 102) | public static boolean consecutive(ArrayList<Integer> list2, ArrayList<...
    method timeout (line 125) | public static void timeout(){

FILE: USACO/MowingField.java
  class MowingField (line 4) | public class MowingField {
    method main (line 6) | public static void main(String[] args) throws Exception {

FILE: USACO/NotLast.java
  class NotLast (line 4) | public class NotLast {
    method main (line 6) | public static void main(String[] args) throws Exception {

FILE: USACO/PromotionCounting.java
  class PromotionCounting (line 4) | public class PromotionCounting {
    method main (line 6) | public static void main(String[] args) throws Exception {
    method change (line 31) | public static int change(String[] arr){

FILE: USACO/SeqSum7.java
  class SeqSum7 (line 4) | public class SeqSum7 {
    method main (line 6) | public static void main(String[] args) throws Exception{
    method sum (line 35) | public static int sum(int start, int end){

FILE: USACO/asdf.java
  class asdf (line 4) | public class asdf {
    method main (line 13) | public static void main(String[] args) throws Exception {
    method time (line 37) | public static int time(int k){
    method maxval (line 62) | public static int maxval(int[] stage){
    method min (line 74) | public static int min(int[] stage){

FILE: USACO/friday.java
  class friday (line 4) | public class friday {
    method main (line 6) | public static void main(String[] args) throws IOException {

FILE: USACO/gift1.java
  class gift1 (line 10) | public class gift1 {
    method main (line 12) | public static void main(String[] args) throws IOException {

FILE: USACO/marathon.java
  class marathon (line 4) | public class marathon {
    method main (line 6) | public static void main(String[] args) throws IOException {
    method distance_between (line 35) | public static int distance_between(ArrayList<Integer> p1, ArrayList<In...

FILE: USACO/reorder.java
  class reorder (line 3) | public class reorder {
    method main (line 8) | public static void main(String[] args) throws IOException{
    method indexOf (line 33) | public static int indexOf(int element, int[] arr){
    method cycle (line 42) | public static int cycle(int i, int[] temp){

FILE: USACO/ride.java
  class ride (line 11) | public class ride {
    method main (line 13) | public static void main(String[] args) throws IOException {

FILE: USACO/sample.java
  class sample (line 5) | public class sample {
    method main (line 7) | public static void main(String[] args) throws Exception {
    method timeout (line 20) | public static void timeout(){

FILE: USACO/test.java
  class test (line 6) | public class test {
    method main (line 7) | public static void main(String[] args) throws Exception {