When we want a priority queue, and the following is true: after enqueuing a group of elements, they can be sorted in O( n ) time, and after dequeuing starts, we will never enqueue again; then we should use:
A. a heap for the priority queue
B. a heapify function
C. an array for the priority queue
D. a stack for the priority queue
C
Computer Science & Information Technology
You might also like to view...
Using Boolean logic operators will help broaden your search and give you more results
Indicate whether the statement is true or false
Computer Science & Information Technology
________ reduce the time it takes to run queries and reports
A) Indexes B) Ideas C) Suggestions D) Recommendations
Computer Science & Information Technology