Analysis Categorizing Grid Kate Deibel November 11, 2003 Categorizing Grid

This activity allows instructors to see if students are aware of the computational complexities of several common algorithms.

This activity will give you the opportunity to recall the computational complexities of several algorithms. Place each item in the Algorithm box under the heading that bests describes it.



O(1) O(log n) O(n) O(n log n) O(n2)












Algorithms
  1. Finding an element in an unordered array
  2. Finding an element in an unordered linked list
  3. Finding an element in an ordered array
  4. Finding an element in an ordered linked list
  5. Removing the ith item in an unordered array
  6. Removing the ith item in an ordered array
  7. Removing the ith item in a linked list
  8. Sorting a linked list
  9. Sorting an array
  10. Insertion sort
  11. Bubble sort
  12. Merge sort
  13. Quick sort
  14. Finding the median of a series of numbers
  15. Finding the mean of a series of numbers
  16. Finding the mode of a series of numbers
  1. O(n): Finding an element in an unordered array
  2. O(n): Finding an element in an unordered linked list
  3. O(log n): Finding an element in an ordered array
  4. O(n): Finding an element in an ordered linked list
  5. O(1): Removing the ith item in an unordered array
  6. O(n): Removing the ith item in an ordered array
  7. O(n): Removing the ith item in a linked list
  8. O(n log n): Sorting a linked list
  9. O(n log n): Sorting an array
  10. O(n2): Insertion sort
  11. O(n2): Bubble sort
  12. O(n2): Merge sort
  13. O(n2): Quick sort
  14. O(n): Finding the median of a series of numbers
  15. O(n): Finding the mean of a series of numbers
  16. O(n log n): Finding the mode of a series of numbers

Run through the grids and mark incorrect or missing entries. Identify the most common errors as well as any patterns that could explain student confusion. Reflect upon these errors and report them back to the class as you see fit.

After deciding on the complexity class, have the students describe in their own words why they feel this is true. 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 lists, the instructor can ask for votes on each item. It is important that the instructor explains why each data structure is appropriate for the task. Have students work individually on their lists and then form groups of 4-5 people to discuss their individual lists with other members of the group. Develop analytic skills Develop ability to draw reasonable inferences from observations Improve memory skills Develop appropriate study skills, strategies, and habits Learn terms and facts of this subject Learn concepts and theories of this subject Algorithms Efficiency Complexity Analysis big-O LOW LOW LOW LOW Lecture Next Day Summary Class Discussion Homework Has Been Enabled Sorting Searching Data Structures