what is the time complexity for “public boolean add(E e)” of Class PriorityQueue<E>?
1 answers
solution1
3 2014-06-10 11:52:07
http://docs.oracle.com/javase/7/docs/api/java/util/PriorityQueue.html#add%28E%29
Implementation note: this implementation provides O(log(n)) time for the enqueing and dequeing methods (offer, poll, remove() and add); linear time for the remove(Object) and contains(Object) methods; and constant time for the retrieval methods (peek, element, and size).
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
Can method add of class PriorityQueue<E> return false?
What is the time complexity of the addFirst(e) and the removeFirst() methods
What does “public class Nir<E>” mean?
Difference between add(E e) and offer(E e) of ArrayDqueue Class
Time complexity of e^x function
What is the time complexity of this priorityQueue
Is my empty "public class xList<E> extends ArrayList<E>" concrete?
Finesse Class<E> into Class<E[]>
how to write a public class MyList<E>?
What does the first <E> signify in public static <E> Set<E> someFunction(){}
Related Tags