From 1a953fe4560a83708cf16c7dd012a097f6a5fb19 Mon Sep 17 00:00:00 2001 From: unknown Date: Sun, 17 Dec 2017 01:15:38 +0900 Subject: [PATCH 1/2] Modified Data Dynamic Programming folder .java file name and class name --- Dynamic Programming/LevenshteinDistance.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Dynamic Programming/LevenshteinDistance.java b/Dynamic Programming/LevenshteinDistance.java index 8a5f7249cad9..be0e7c43f112 100644 --- a/Dynamic Programming/LevenshteinDistance.java +++ b/Dynamic Programming/LevenshteinDistance.java @@ -6,7 +6,7 @@ * */ -public class Levenshtein_distance{ +public class LevenshteinDistance{ private static int minimum(int a, int b, int c){ if(a < b && a < c){ return a; From 58e1bca4e81326d9cb6cfcc01d1c8bae87d6dbe0 Mon Sep 17 00:00:00 2001 From: unknown Date: Sun, 17 Dec 2017 01:20:22 +0900 Subject: [PATCH 2/2] Modified Data Misc folder .java file name and class name --- Misc/heap_sort.java | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Misc/heap_sort.java b/Misc/heap_sort.java index 59d362e5481b..991d689ba70f 100644 --- a/Misc/heap_sort.java +++ b/Misc/heap_sort.java @@ -1,4 +1,4 @@ -public class HeapSort +public class heap_sort { public void sort(int arr[]) { @@ -64,7 +64,7 @@ public static void main(String args[]) int arr[] = {12, 11, 13, 5, 6, 7}; int n = arr.length; - HeapSort ob = new HeapSort(); + heap_sort ob = new heap_sort(); ob.sort(arr); System.out.println("Sorted array is");