Skip to content

Modified Data Misc folder .java file name and class name #362

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Dec 16, 2017
Merged

Modified Data Misc folder .java file name and class name #362

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1a953fe
Modified Data Dynamic Programming folder .java file name and class name
wannee2 Dec 16, 2017
58e1bca
Modified Data Misc folder .java file name and class name
wannee2 Dec 16, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Dynamic Programming/LevenshteinDistance.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions Misc/heap_sort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
public class HeapSort
public class heap_sort
{
public void sort(int arr[])
{
Expand Down Expand Up @@ -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");
Expand Down