Merge pull request ronijpandey#20 from antrix190/master

ronijpandey · web-flow · commit 2d09aea7393b · 2017-10-30T12:33:24.000+05:30
Added heap sort
diff --git a/DigitalMax.java b/DigitalMax.java
@@ -1,5 +1,3 @@
-package javacodes;
-
 import java.util.*;
 
 public class DigitalMax {
diff --git a/Dine.java b/Dine.java
@@ -3,6 +3,7 @@
 
 public class Dine {
 
+
     public static void main(String[] args) {
 
         int x = 10;
diff --git a/HeapSort.java b/HeapSort.java
@@ -0,0 +1,54 @@
+
+/**
+ * Created by antrix190 on 22/10/2017
+ */
+public class HeapSort {
+	/*
+	 * HeapSort is a comparison based sorting algorithms that uses a binary heap data structure. Its run time 
+	 * complexity is O(nlogn).
+	 * */
+	public void sort(int arr[]){
+
+		int n = arr.length;
+
+		//Create heap
+		for (int i = n / 2 - 1; i >= 0; i--)
+			heapify(arr, n, i);
+
+		for (int i=n-1; i>=0; i--){
+			//Moving current root to the end.
+			int temp = arr[0];
+			arr[0] = arr[i];
+			arr[i] = temp;
+
+			//call Max heapify on the remaining heap.
+			heapify(arr, i, 0);
+		}
+	}
+
+	void heapify(int arr[], int n, int i){
+		//init 
+		int largest = i;  
+		int l = 2*i + 1;  
+		int r = 2*i + 2;  
+
+		//if left child is larger than root, largest =left.
+		if (l < n && arr[l] > arr[largest])
+			largest = l;
+		//if right child is larger than largest, largest =right
+		if (r < n && arr[r] > arr[largest])
+			largest = r;
+
+		//if largest is not root.
+		if (largest != i){
+			
+			//rearrange the heap.
+			int swap = arr[i];
+			arr[i] = arr[largest];
+			arr[largest] = swap;
+
+			//Recursively heapify.
+			heapify(arr, n, largest);
+		}
+	}
+}
diff --git a/TicTacToe.java b/TicTacToe.java
@@ -1,4 +1,3 @@
-package javacodes;
 
 import java.util.Scanner;
 
diff --git a/University.java b/University.java
@@ -1,8 +1,6 @@
-/**
- * This class represents University and contains it's child domain classes(Course, Student, Sem, Department and Institute)
- */
-package javacodes;
-
+/*		
+ this program is used to find minimum distance between two vertices while traversing all available vertices.		
+ */
 import java.util.*;
 
 /**

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,3 @@`
`1`		`-package javacodes;`
`2`		`-`
`3`	`1`	`import java.util.*;`
`4`	`2`
`5`	`3`	`public class DigitalMax {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,3 @@`
`1`		`-package javacodes;`
`2`	`1`
`3`	`2`	`import java.util.Scanner;`
`4`	`3`