We started our class by contrasting binary and linear searching. There is an online guessing game, and with it, the students could try linear searching and binary searching to see which was fastest. Once we completed and talked about that part of the assignment, we learned five different ways a computer can be programmed to sort data: quick sort, insertion sort, selection sort, bubble sort, and merge sort. Each student had part of a deck of playing cards (2-10) and I had magnetic cards on the board. First, we mixed up our decks to be in a random order, then laid them out in a row (numbers facing up), and finally we sorted them using the particular sort we were learning at that moment. To a programmer, these might seem like common-sense ways to sort, but for most people, it's the first time they've heard of so many options.
|
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
April 2024
Categories |