1
Student Name: __________________
Class and Section __________________
Total Points (15 pts) __________________
Due: March 25, 2015 before the class
Project: Compare Priority Queue Implementation
CSCI 2410 Data Structures and Algorithms
Armstrong Atlantic State University
Problem Description:
The book uses a heap to implement the priority queue. Revise the
implementation using a sorted array list to store the elements. The
elements in the array list are sorted in increasing order of their
priority with the last element having the highest priority.
Write a test program that generates 5 million integers and
enqueues them to the priority and dequeues from the queue.
Use the same numbers for PriorityUsingHeap and
PriorityUsingSortedArrayList and display their execution
times.
What to submit?
1. Submit to LiveLab as PriorityQueueTest.
2. Print a screen shot that shows your program execution time.