So far we have looked at the code for sorting. You have seen how to sort numbers using three different methods.

There are more ways to sort integers and also for strings (text), but these are the basic and most important ones to get you started.

It can however be difficult to see what is happening when the code is running and how the numbers are sorted one move at a time. So we will use the finch to help us and those who we are teaching.

We will be using the two classes from the Java tutorial in week 5; namely, the <Sorts> and the <SortGrades> classes.

In this exercise, use post-it notes or pieces of paper to write down the numbers from the classes to sort down. These are: [89, 94, 69, 80, 97, 85, 73, 91, 77, 85, 93].

We then use this code (highlighted text indicates changes) in order to make the finch tell us which numbers to change each time until they are sorted.

The code will do this for the initial bubblesort code.

The challenge this week is for you to alter the code in order for the other two algorithms to also allow the robot to tell you what to change.