I will be doing: Day 15-16: Sorting
The reason I choose this lesson is because I witnessed its execution during training and felt it needed improvement. In the lesson that I experienced the group used labelled brown bags containing objects to create different weights. This was very distracting to the goal of the lesson. There was too much focus and time consumed on trying to figure which object was heavier rather than the main goal of determining the steps or procedure/algorithm to “efficiently sort or rearrange” the items in a particular order. Therefore, I hope to use manipulatives that are clearly labelled with their weight or number assignment to facilitate the sorting step. It is also important that the group keeps a record of every time a comparison is made to determine whether they need to reorder an item or not. In the field of computer science this number/count is used to determine the efficiency of the algorithm.
Also, the teacher must make the students start with a “worst-case” sorting scenario, which means that the list must be completely reversed. For example, you want them to determine how many data comparisons it will take to sort a list of 10 numbers that start in descending order to end in ascending order using two different sorting algorithms. Doing so will clearly reveal which algorithm is more efficient when they keep track of the number of comparisons made. Comparisons translate into CPU time = program run time.