Title: Sorting Defining Features Matrix

Author: Kate Deibel

Date: March 30, 2004

Technique: Defining Features Matrix

Before Class Preparation Time: MEDIUM

Class Completion Time: LOW

In-Class Analysis Time: LOW

Out-Of-Class Analysis Time: LOW

Assessment Goals:
Topics:
Purpose:

This exercise gives instructors the chance to find out if students understand the similarities and differences between various sorting algorithms.


Activity:

Fill out the following matrix. This matrix lists various sorting algorithms and it's your job to decide if these algorithms possess various properties. Assume that your are assorting arrays, not linked lists. Please complete the table with '+' or '-' labels.

  O(n log n running time) Best-case performance: O(n) Stable In-place
Selection Sort        
Insertion Sort        
Merge Sort        
Quick Sort        
Heap Sort        

Solution:
  O(n log n running time) Best-case performance: O(n) Stable In-place
Selection Sort - - + +
Insertion Sort - + + +
Merge Sort + - + -
Quick Sort - - - +
Heap Sort + - - +

Instructor Responses: Response Analysis:

The following must be done out of class:

  1. In a first pass, mark and count the number of incorrect answers. Also, mark any answers that you find surprising.
  2. For each question that has a significant (your judgement call) of incorrect answers, do the following:
    1. Look through the answers to these questions.
    2. Attempt to identify the nature of the most common errors that are made.
  3. Discuss these errors in class, using the common mistakes that you identified .

In-class feedback can be done by having students write or say out loud their own answers, but caution must be taken to avoid embarassing or ridiculing a student for making mistakes.



Variant Uses of Activity:
Device-Enabled: Has Been Enabled

Related Topics: