Modify the SumAvgMax program to include determining whether the
numbers that are entered are entered in increasing order.  For
example, if the numbers entered are 3, 6, 8, 13, then report yes. 
If the numbers entered are 5, 8, 3, 12, then report no, they are not
in increasing order.
The code only needs to check each number to see if it is smaller than
the previously entered number, in which case it sets a variable to no.
The previously entered number is set to the current number before the
next number is input.




Count the number of times the data transition from positive to negative
and negative to positive.
Example:  5 2 8 -2 -4 1 -3
has 3 such transtitions (8 to -2, -4 to 1, 1 to -3)


Count the number of consecutive duplicates.
Example: 5 2 8 8 2 4 4 4 3
has 3 "duplicates": 8 8, 4 4, 4 4(second time)


For each positive integer output a string of that many *'s.
Hint: loop concatenating a * character to a string variable.



Draw three concentric circles in the middle of the graphics window.  The
circles' radiuses are the minimum, average, and maximum of the
numbers.  Draw them in decreasing size order so the smaller ones are
on top of the larger ones (otherwise only the largest will be
visible).

*********************************
Make a program that inputs an integer and determines the number of
digits it has.  

**********************************
Coin flipping program:

during the flippings find the largest difference between the number of
heads and the number of tails, i.e. where the number of heads is the
most more than the number of tails. This is a find the maximum
problem, so a max variable is needed and each time there is a new max
value it becomes the value of the max variable. The value is the
difference between the number of heads and tails, which is
heads-tails.

Example:
flips:
 h h h t t h h t t t h
heads-tails values:
 1 2 3 2 1 2 3 2 1 0 1
So the max gap is 3.

When that works, add similar code to find the biggest difference where
the number of tails is the most more than the number of heads.

*************************************

Harderer:

find the longest run of heads and of tails. 

Example:
 h h h t t h h t t t h
longest run of heads is 3
longest run of tails is 3