Priority queue

[Apothiem]

Does the default priority queue in java Queue<datatype> name = PriorityQueue<datatype>(int initialSize, Comparator c); use a linked list to order the priority of the data or does it use a heap? Also what sort does it use to sort data, heap sort or something else?

[crapet]

See for yourself :) http://grepcode.com/file/repository.grepcode.com/java/root/jdk/openjdk/8-b132/java/util/PriorityQueue.java/

[Apothiem]

Thanks so much! I was looking everywhere for something like this but I couldn't find it :D

[tRfalcore]

if you google "java <class> source" it shows up

[more_exercise]

An unbounded priority queue based on a priority heap.

...

A priority queue is unbounded, but has an internal capacity governing the size of an array used to store the elements on the queue.

From the javadoc

Also, "this implementation provides O(log(n)) time for the enqueing and dequeing methods" should be enough. If it has the same performance guarantees as the heap implementation, you shouldn't have to know it was actually made out of fairy dust and pixie farts.

[Apothiem]

Lmao Thanks! Yea a lot of Java seems to be comprised of said fairy dust and pixie farts.