-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHeap_Sort.java
More file actions
58 lines (47 loc) · 1012 Bytes
/
Copy pathHeap_Sort.java
File metadata and controls
58 lines (47 loc) · 1012 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
public class Heap_Sort {
public void sort(int arr[]){
int n = arr.length;
for(int i=n/2-1;i>=0;i--){
heapify(arr,n,i);
}
for(int i=n-1;i>=0;i--){
int temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
heapify(arr,i,0);
}
}
void heapify(int arr[],int n,int i){
int largest = i;
int l =2*i+1;
int r = 2*i+2;
//if left child is larger than root.
if(l<n && arr[l]>arr[largest]){
largest = l;
}
if(r<n && arr[r]>arr[largest]){
largest = r;
}
if(largest!=i){
int swap = arr[i];
arr[i] = arr[largest];
arr[largest] = swap;
heapify(arr,n,largest);
}
}
static void printArray(int arr[]){
int n = arr.length;
for(int i=0;i<n;i++)
System.out.print(arr[i]+ " ");
System.out.println();
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[] = {12,11,13,6,5,7};
int n = arr.length;
Heap_Sort ob = new Heap_Sort();
ob.sort(arr);
System.out.println("Sorted array is");
printArray(arr);
}
}