Merge pull request #276 from KennethNero/Comments&Fixes

Comments&fixes

Dynamic Programming/Levenshtein_distance.java

@@ -17,8 +17,8 @@ public class Levenshtein_distance{
 		}
 	}
 	private static int calculate_distance(String a, String b){
-		len_a = a.length() + 1;
-		len_b = b.length() + 1;
+		int len_a = a.length() + 1;
+		int len_b = b.length() + 1;
 		int [][] distance_mat = new int[len_a][len_b];
 		for(int i = 0; i < len_a; i++){
 			distance_mat[i][0] = i;

Dynamic Programming/rod_cutting.java

@@ -2,8 +2,7 @@
     Returns the best obtainable price for a rod of
 	length n and price[] as prices of different pieces */
 
-public class RodCutting
-{
+public class RodCutting {
 	
 	private static int cutRod(int price[],int n)
 	{

Others/Abecedarian.java

@@ -12,6 +12,6 @@ class Abecedarian{
 
             else{return false;}
             }
-        }
         return true;
+        }
 }

Others/Dijkshtra.java

@@ -4,6 +4,11 @@
 */
 
 
+import java.io.IOException;
+import java.util.Arrays;
+import java.util.Scanner;
+import java.util.Stack;
+
 public class Solution {
 
 public static void main(String[] args) throws IOException {
@@ -30,7 +35,7 @@ public static void main(String[] args) throws IOException {
 	
 	//Implementing Dijkshtra's Algorithm 
 	
-         Stack <Integer> t=new Stack<Integer>();
+         Stack<Integer> t=new Stack<Integer>();
           int src=in.nextInt();
         for(int i=1;i<=n;i++){
         	if(i!=src){t.push(i);}}

Others/Factorial.java

@@ -1,4 +1,3 @@
-package factorial;
 import java.util.Scanner;
 
 /**

Others/FloydTriangle.java

@@ -1,6 +1,5 @@
 import java.util.Scanner;
 
-
 public class FloydTriangle {
     public static void main(String[] args) {
           Scanner sc = new Scanner(System.in);

Others/ReverseStackUsingRecursion.java

@@ -67,8 +67,4 @@ public class ReverseStackUsingRecursion {
 
     }
 
-
-
-
-
 }

Others/ReverseString.java

@@ -39,7 +39,7 @@ class ReverseString
 		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
 		System.out.println("Enter the string");
 		String srr=br.readLine();
-		System.out.println("Reverse="+reverseString(srr));
+		System.out.println("Reverse="+reverse(srr));
 		br.close();
 	}
 }

Others/krishnamurthy.java

@@ -1,4 +1,5 @@
 import java.util.Scanner;
+
 class krishnamurthy
 {
  int fact(int n)

Others/root_precision.java

@@ -1,8 +1,4 @@
-import java.io.*;
 import java.util.*;
-import java.text.*;
-import java.math.*;
-import java.util.regex.*;
 
 public class Solution {
 

Sorts/radixSort.java

@@ -1,5 +1,3 @@
-
-import java.io.*;
 import java.util.*;
  
 class Radix {

data_structures/Graphs/PrimMST.java

@@ -1,9 +1,7 @@
 // A Java program for Prim's Minimum Spanning Tree (MST) algorithm.
 //adjacency matrix representation of the graph
- 
-import java.util.*;
+
 import java.lang.*;
-import java.io.*;
  
 class PrimMST
 {

data_structures/HashMap/HashMap.java

@@ -1,5 +1,3 @@
-
-
 import java.util.ArrayList;
 import java.util.LinkedList;