Selection sort algorithm

We are sorting the following list in ascending order:

5 4 2 9 3 1 8

What does the list look like after ONE pass of the selection sort algorithm?

• 1 2 4 3 8 5 9

• 1 4 2 9 3 5 8

• 1 5 4 2 9 3 8

• 4 5 2 9 3 1 8

Selection Sort puts all of the items in an array in:

• ascending order only

• descending order only

• ascending or descending order

• neither ascending or descending order

The Selection Sort algorithm repeatedly finds the smallest value in the list, then swaps it into its sorted position.

• True

• False

Why might a sorting algorithm be needed before a search?

• Data is less when sorted

• Data cannot be searched if it not sorted

• Data can be retrieved faster and easier when sorted

• Data must always be sorted before it is searched

We are sorting the list in descending order:

Stacy Mark Arnold Betty Tom

What does the list look like after ONE pass of the selection sort?

• Stacy Mark Arnold Betty Tom

• Arnold Stacy Mark Betty Tom

• Arnold Betty Stacy Mark Tom

• Tom Stacy Mark Betty Arnold

What does a sorting algorithm do?

• Finds an item of data in a list

• Puts a list of items into order

• Saves a set of data

• Separates a list of data