5.04 Sorting Algorithms

5.4 Sorting Algorithms Curriculum Page

Sorting Algorithms: https://docs.google.com/document/d/1IGDsjkigYgTlnLKyR1K8KjjPVEOzqP9EXp8AsQICjWo/edit?usp=sharing

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 sort are not comparison sorts because they do not compare the value of two pieces of data during each step. Instead the radix and bucket sort put pieces of data into incremental bins and sorted that way.

2. Which sort do you think would be the fastest if you had to sort more than one deck of cards? Why?

Probably using a bucket sort would be the fastest way to sort if you had more than one deck of cards. This is because in a bucket sort you don't have to compare every card to every other card, you can just place them in groups and then sort the groups. This would be much more efficient than looking at individual cards.