^Shaker Sort
~Given the following numbers in array A ...

12 21 27 35 43 45 65 53 58 44

... how many passes will it take to completely sort the numbers using the
Shaker Sort?  Once down, and once up is considered to be 2 passes.
Include, in the count, a last pass checking the numbers that are
already sorted.


a.  3
b.  8
c.  7
d.  1
e.  9