5.04 Sorting Algorithms

5.4 Sorting Algorithms Curriculum Page

Portfolio Reflection Questions:

1. Bubble and Merge Sort are referred to as comparison sorts because the values of the two pieces of data are compared during each step. Why are the radix and bucket sort not comparison sorts?
   • The radix and bucket sorts aren't comparison sorts because the values of the cards aren't being compared with one another. Instead, you are supposed to look at the card as an individual value. In order to categorize them, you are supposed to group them with similar cards (ie. suits, numbers, colors) which are the "buckets," and then you combine them to get them in sequential order.
2. Which sort do you think would be the fastest if you had to sort more than one deck of cards? Why?
   • The fastest sort method if there was more than one deck of cards would be the merge sort because it takes small groups of cards and merges them into ever larger groups.