The Python random group chooser did it's thing, and gave us the following groups for this unit:

• Turner, Caleb, Cody and Parker
• Marin, Luis, Anfal and Ved
• Anar, Johan, Issac and Jamethiel
• Trostin, Akshay and Adonis

All groups will work this week on implementing the priority queue ADT using both this implementation of linked lists and an array.

At the start of class next Monday, each group will have ready to present:

1. A PriorityQueue class that inherits from LinkedList (which can not be changed!
2. A PriorityQueue class using a C array for data storage.
3. A suite of unittests using doctest that test both implementations (ideally, a single suite that tests both).

One group will be randomly choosen to present at the start of class on Monday, and the rest of the groups will be invited to share anything afterward they feel would add to the first groups presentation.

The groups not choosen to present will have their git repos evaluated for credit on this assignment.

A quiz will likely follow on Wednesday.