Created
April 10, 2014 17:27
-
-
Save jayeshsolanki93/10404428 to your computer and use it in GitHub Desktop.
HeapSort in Java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.util.Arrays; | |
| import java.util.Scanner; | |
| class HeapSort { | |
| private static Scanner sc; | |
| public static void main(String args[]) { | |
| sc = new Scanner(System.in); | |
| System.out.println("Enter no of terms"); | |
| int n = sc.nextInt(); | |
| System.out.println("Enter the terms"); | |
| int arr[] = new int[n]; | |
| for (int i = 0; i < n; i++) | |
| arr[i] = sc.nextInt(); | |
| System.out.println("The unsorted array is:"); | |
| System.out.println(Arrays.toString(arr)); | |
| heap(arr); | |
| System.out.println("The sorted array is:"); | |
| System.out.println(Arrays.toString(arr)); | |
| } | |
| static void heapify(int a[], int n, int i) { | |
| int max, child; | |
| child = 2 * i + 1; | |
| max = i; | |
| if (child < n) | |
| if (a[child] > a[max]) | |
| max = child; | |
| if (child + 1 < n) | |
| if (a[child + 1] > a[max]) | |
| max = child + 1; | |
| if (max != i) { | |
| int temp = a[i]; | |
| a[i] = a[max]; | |
| a[max] = temp; | |
| heapify(a, n, max); | |
| } | |
| } | |
| static void buildheap(int a[]) { | |
| for (int i = a.length / 2 - 1; i >= 0; i--) | |
| heapify(a, a.length, i); | |
| } | |
| static void heap(int a[]) { | |
| buildheap(a); | |
| for (int i = a.length - 1; i >= 1; i--) { | |
| int temp = a[0]; | |
| a[0] = a[i]; | |
| a[i] = temp; | |
| heapify(a, i, 0); | |
| } | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment