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;
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");