Contribute to keener101/Max-Heap-Priority-Queue-Java development by creating an account on GitHub.

This is an array representation of priority queue abstract data type using heap data structure. Keep in mind, my implementation starts at index 1 and ignores index 0 of the array.

An Oracle-developed, low-latency Java garbage collector geared to large heaps could move to the open source community, if a proposal to do so gets community approval. Votes are due by November 8.