5.4 Sorting Algorithms

For which of the problems would the bubble sort algorithm provide an appropriate solution. Choose all that apply.

• Arranging a deck of cards from the lowest to the highest value cards.

• Looking up a name in the phone book.

• Sorting a stack of paper money into denominations -- i.e., $1, $5, $10 etc.

• Sorting a basket of laundry into socks, shirts, shorts, and sheets.

• Arranging books on a bookshelf by author's last name.

Suppose you are sorting the following list of numbers inascending order using bubble sort: [16, 5, -1, 4, 12, 17, 3, 10, 5, 9]. After the first pass through the numbers, what value would appear on the right of the list?

• 16

• 17

• 9

• -1

• 5

Suppose you are sorting the following list of words into alphabetical order using bubble sort: [apple, orange, banana, papaya, lemon, pumpkin, squash, tomato]. After the first pass through the list, what word would appear on the right of the list?

• apple

• squash

• tomato

• pumpkin

• papaya

Suppose you are sorting the following list of words in alphabetical order using bubble sort: [apple, banana, lemon, tomato, orange, squash, papaya, pumpkin]. Which of the following gives the correct order of the list after two passes through the list?

• [apple, banana, lemon, tomato, orange, squash, papaya, pumpkin]

• [apple, banana, lemon, squash, tomato, orange, papaya, pumpkin]

• [apple, banana, lemon, orange, papaya, pumpkin, tomato, squash]

• [apple, banana, lemon, orange, papaya, pumpkin, squash, tomato]

• [apple, banana, lemon, orange, papaya, squash, tomato, pumpkin]

Which of the following sorts are comparison sorts?

• Radix

• Bubble

• Merge

• Bucket