Team Size: 2
In this class, students will be responsible for presenting the sorting algorithms covered in class. It is expected that the presentation will last about half of the class. Students are not expected to use computers for their presentation (though they are allowed to!). Instead, you could use the board or an overhead projector. Whatever works best for your team!
Each algorithm will be covered as it appears in the class, and thus groups should be prepared to present ahead of time. The class schedule will approximate when each presentation will be made. Please be prepared within a day of each side of that.
Your presentation should cover the following:
- A description of the algorithm, using algorithmic notation.
- An example run of the steps of algorithm on an array of length ten or greater.
- Analysis of the algorithm's worst-case time efficiency. If the algorithm is recursive, this should include solving a recurrence relation.
- Best- or average-case time efficiency analysis, if relevant.
I will use this sheet to grade your presentations.
The following are the presentation assignments, which will occur in this order.
|RadixSort||Will, Nate, Colin|