Introduction to more complex sorting algorithms.
The student will:
Distinguish between and implement O(n2) sorting algorithms.
Distinguish between and implement O(nlogn) sorting algorithms.
The student will:
Use Arrays as the underlying data structure for different ADT implementations.
Explain the trade-offs between an array vs. Linked implementation of the ADTs.
Quiz 26 Nov 12:00 AM
Outcomes assessed: Learn about and implement standard algorithms for sorting arrays
‘“This assessment will verify that students understand the basics of heap data structures.”’
Quiz 28 Nov 12:00 AM
Outcomes assessed: Learn about and implement standard algorithms for sorting arrays
This assessment will verify that students understand the basics of merge algorithm.
Assignment
This assessment will verify that students understand how choose the correct ADT to implement a Potion bag with performance requirements.