-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathheapTester.java
More file actions
41 lines (33 loc) · 887 Bytes
/
Copy pathheapTester.java
File metadata and controls
41 lines (33 loc) · 887 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
/*Whatcom Community College - Winter 2019
CS240 Data Structures and Algorithm Analysis
Professor Ryan Parsons
AUTHORS: Adib Thaqif, Andrew Jacobi, Donald Strong, and Micah Miller
Heap tester
*/
import java.io.*;
import java.util.*;
public class heapTester{
//public EventHashTable
public static void main(String[] args){
int maxSize = 20;
IntHeap heap = new IntHeap(maxSize);
heap.insert(9);
heap.insert(4);
heap.insert(3);
heap.insert(6);
heap.insert(1);
heap.insert(12);
heap.insert(7);
heap.insert(8);
heap.insert(15);
heap.insert(5);
heap.insert(11);
heap.insert(22);
//heap.deleteMin();
//heap.deleteMin();
System.out.println(heap);
}
public static int sum(int x, int y){
return x + y;
}
}