1.9	Hello World!
I'm talking about a routine to scramble.
You quite often need to sort into alphabetical order,
But sometimes you need to scramble the list.
And the scramble algorithm is fairly simple.
We're going to move through each element
in the array.
And for each element
we pick a random number
of one of the other elements in the array.
and then we swap those two items.
Let's step through this and see how it works.
i has a value of zero
and that would be "Amy"
and were going to find a random value r
which is 4 which would be "Mike",
and then I'm going to swap "Amy" and "Mike"
So I store "Amy" in temp,
Then I put "Mike"
in name sub zero.
and then I put "Amy" in name sub 4. ( name[4])
Next value of i is one
and we are looking at "Bill"
and r is 3,
so we're going to swap "Bill" and "Jay"
So we store "Bill" in temp.
or name sub i (name[i])
And then we put name sub r (name[r])
into name sub  i (name[i])
and then we put temp
into name sub r,  which is 3.
Next value of  i is 2
and so we are going to
swap "Dave" with some random person.
in this case "Jay",  and...
Now we're swapping "Bill" and "Jay"
And now i is 3
and were going to swap "Jay" with some random person.
"Bill"
And that's it.
And you can see they were in alphabetical order when we started
and now it's random.