Question

Drag each label to the correct location. Not all labels will be used.

Complete the algorithm that accepts a list of names from a user and displays the longest name.

Start at the first name in the list.
1. Start.
2. Read p
the list of names name[].
3. Set name as
4. Set length as 0.
5.
6. If you have reached the end of the list, then go to step 12.
7. If the length of the current name is greater than length, then go to step 8, else go to step 10.
8. Set length as the length of the current name.
9. Set name as the current name.
10. Advance to the next name.
11.
12. Display name.
13. Stop

Answer 1

Start at the first name in the list.

Start.

Read the list of names name[].

Set name as the first name in the list.

Set length as the length of the first name.

Repeat steps 6-11 for each name in the list:

If you have reached the end of the list, then go to step 12.

If the length of the current name is greater than length, then go to step 8, else go to step 10.

Set length as the length of the current name.

Set name as the current name.

Advance to the next name.

Repeat steps 6-11.

Display name.

Stop.