1
COP 4530/CGS5425: Data Structures, Algorithms, and Generic Programming
Florida State University, Dept. of Comp. Sci., Fall 2006
Instructor: Breno de Medeiros
TA: Ling Toh
Assignment 5: Priority Queues
Goals:
In this assignment, you will be required to implement a template class for a priority
queue object, i.e. you are required to complete the implementation for the
Priority_Queue class. You will also be required to implement the heap sort
algorithm on the priority queue to rearrange the items of a container in descending order.
Requirements for Priority_Queue class
A partial interface and implementation of the Priority_Queue class is provided in the
distributed priority_queue.h files.
The underlying Priority_Queue data structure is any container type that has its
operator [] overloaded.
A Priority_Queue object could be declared as ,
Priority_Queue <vector<int> > Q1; //underlying vector stores integer values
//underlying deque stores ch aracter values, and uses the greater function
//object for comparison
Priority_Queue <deque<char>, greater<char> > Q2;
//underlyingBasicContainer s tores floating-point valu es and uses the less
//function object for compar ison
Priority_Queue <BasicContain er<float>, less<float> > Q3;
The partially distributed priority_queue.h file contain the following implementations:
template <typename T>
class LessThan
{
public:
bool operator()( const T &x, const T &y ) { return x < y;}
};
template <class C, class P = class LessThan<typename C::value_type> >
class Priority_Queue
{
public:
typedef typename C::value_type value_type;
