Module: Complex Sorting Algorithms

Introduction to more complex sorting algorithms.

Learning Outcomes

Implement and use complex sorting algorithms correctly.

Implement and use heap, merge, shell, and quick sorts correctly.
Understand performance trade-offs for each of these sorting algorithms.

Readings

Chap. 8 Sect. 8.6 - 8.9

Shell, Merge, Heap, and Quick Sorts

Textbook Exercises

Sorting 2

More efficient sorting.

screencast 30:00 min

Experiential Learning

Heap Practice Quiz

Write the reheap method.

Practice

Quiz 21: Create a heap in an array.

Show the resulting heap.

Quiz

Quiz 22: Merge two sorted arrays into a third array.

Implement the merge method.

Quiz

A10: Sorting Performance

Implement Heapsort, Quicksort, Mergesort.

Homework Assignment