*********************Result**************************************

********************Series Output*********************************

Upper Bound of findMin(A) is nat(A)+1
Upper Bound of minSort(A) is nat(A)* (nat(A)+1)/2+2*nat(A)+2

*******************RAML Output************************************
The number of ticks consumed by findMin is at most:
          n + 1.0
where
   n is the length of the input

The number of ticks consumed by minSort is at most:
          0.5*n^2 + 2.5*n + 2.0
where
   n is the length of the input

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