Repository navigation
Expand file tree
/
Copy pathHeapSort_Java.java
More file actions
76 lines (59 loc) · 1.95 KB
/
Copy pathHeapSort_Java.java
File metadata and controls
76 lines (59 loc) · 1.95 KB
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
import java.util.Scanner;
public class HeapSort {
// ---------- Heapify Function ----------
public static void heapify(int[] arr, int n, int i) {
int largest = i; // root
int left = 2 * i + 1; // left child
int right = 2 * i + 2; // right child
// If left child is larger
if (left < n && arr[left] > arr[largest]) {
largest = left;
}
// If right child is larger
if (right < n && arr[right] > arr[largest]) {
largest = right;
}
// If largest is not root
if (largest != i) {
int temp = arr[i];
arr[i] = arr[largest];
arr[largest] = temp;
// Recursively heapify the affected subtree
heapify(arr, n, largest);
}
}
// ---------- Heap Sort Function ----------
public static void heapSort(int[] arr) {
int n = arr.length;
// Build max heap
for (int i = n / 2 - 1; i >= 0; i--) {
heapify(arr, n, i);
}
// Extract elements from heap one by one
for (int i = n - 1; i > 0; i--) {
// Move root to end
int temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
// Heapify reduced heap
heapify(arr, i, 0);
}
}
// ---------- Main Method ----------
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter size of array: ");
int n = sc.nextInt();
int[] arr = new int[n];
System.out.println("Enter " + n + " elements:");
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
heapSort(arr);
System.out.println("Sorted Array:");
for (int x : arr) {
System.out.print(x + " ");
}
sc.close();
}
}