Module: Complex Sorting Algorithms

Introduction to more complex sorting algorithms.

Learning Outcomes

Learn about and implement standard algorithms for sorting arrays

The student will:

Distinguish between and implement O(n²) sorting algorithms.
Distinguish between and implement O(nlogn) sorting algorithms.

Learn about and understand the Array data structure.

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.

Readings

Text: 8.6 - 8.9

Shell, Merge, Heap, and Quick Sorts

Textbook Exercises 27 Apr 12:00 AM

SC: Sorting 2

More efficient sorting.

screencast 30:00 min 27 Apr 12:00 AM

Experiential Learning

Heap Practice Quiz

Write the reheap method.

Practice Quiz

Practice: Heap Sort

Practicing with the Heap Sort

27 Apr 10:30 AM

Practice: Merge and Quick Sorts

More complex sorting algorithms.

27 Apr 10:30 AM

Complex Sorting Flip-Flop Quiz

Write a Flip-Flop quiz for the Complex Sorting lecture video.

Flip-Flop 27 Apr 11:55 PM

H10: Implement a Data Structure

Create 3 Potion Bags

26 Apr 11:55 PM

Assessments

Q24: Heaps

Quiz 27 Apr 10:30 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.”’

Q25: Merge

Quiz 27 Apr 10:30 AM

Outcomes assessed: Learn about and implement standard algorithms for sorting arrays

This assessment will verify that students understand the basics of merge algorithm.

H10: Complex Sorting Assessment

Assignment

Outcomes assessed: Learn about and implement standard algorithms for sorting arrays, Learn about the Java programming language, Be exposed to software engineering techniques, Be exposed to software testing techniques

This assessment will verify that students understand the basics of sorting algorithms.