]> Sorting Defining Features Matrix Kate Deibel March 30, 2004 Defining Features Matrix

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

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        


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

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.

Have students write short explanations for their answers in the matrix. Have students work in groups to complete this activity. The instructor may want to circulate throughout the groups to ensure that each group is making progress. After the groups have completed their matrix, the instructor can ask for volunteers for each item. Be sure to ask for explanations as to why they assigned a plus or minus to each column. Have students work individually on their problems and form a small group to discuss their answers. Develop analytic skills Improve memory skills Learn terms and facts of this subject Learn concepts and theories of this subject Sorting Algorithms Efficiency Complexity Stable sorts In-place sorts MEDIUM LOW LOW LOW Lecture Next Day Summary Class Discussion Small Group Discussions Homework Has Been Enabled Search Trees