-
Notifications
You must be signed in to change notification settings - Fork 0
/
HeapCheck.java
64 lines (64 loc) · 2.42 KB
/
HeapCheck.java
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
import java.util.Scanner;
import heapds.Heap;
public class HeapCheck {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int capacity = 8;
Heap heap = new Heap(capacity);
int choice,flag;
while(true) {
System.out.println("Select an option:\n1.Insert\n2.Build Heap\n3.Heap Sort\n4.Destroy Heap");
choice = sc.nextInt();
switch(choice) {
case 1:
System.out.println("Enter the element to be inserted: ");
int element = sc.nextInt();
heap.insert(element);
System.out.print("Heap: ");
heap.printHeap();
break;
case 2:
System.out.print("Enter no. of elements to be inserted: ");
int n = sc.nextInt();
System.out.print("Enter the elements: ");
for(int i=0;i<n;i++) {
element = sc.nextInt();
heap.insert(element);
}
System.out.println("Constructed Heap: ");
heap.printHeap();
break;
case 3:
System.out.print("Enter no. of elements to be sorted: ");
n = sc.nextInt();
int[] A = new int[n];
System.out.print("Enter the elements: ");
for(int i=0;i<n;i++) {
A[i] = sc.nextInt();
heap.insert(A[i]);
}
System.out.print("Built Heap: ");
heap.printHeap();
System.out.println("Sorting Heap....");
heap.heapSort(A,n);
System.out.print("Sorted Array: ");
heap.printHeap();
break;
case 4:
heap.destroyHeap();
System.out.println("Heap Destroyed");
heap = null;
heap = new Heap(capacity);
break;
default:
System.out.println("Invalid choice!");
}
System.out.print("Do you want to continue?(1/0): ");
flag = sc.nextInt();
if(flag==0) {
break;
}
}
sc.close();
}
}