anchor.diff:    lo = 1
     hi = size(this)
   
  -  do while (hi > lo)
  -    if (hi - lo < 16) then
  +  do while (hi >= lo)
  +    if (hi - lo < 17) then
         call insertionSort(this, lo, hi)
         res = this(k)
         return
  
positive.code:   res = -1
  
    do while (hi >= lo)
      if (hi - lo < 16) then
        call argInsertionSort(this, indx, lo, hi)
        res = indx(k)
        return
  
negative.code:   lo = 1
    hi = size(this)
  
    do while (hi >= lo)
      if (hi - lo < 17) then
        call insertionSort(this, lo, hi)
        res = this(k)
        return
  