anchor.diff:    integer(i32) :: maxDepth
     integer(i32) :: imid,iPivot
     integer(i32) :: N
  -  N=right-left
  +  N = right - left + 1
     if (N < 16) then
       call argInsertionSort(this,idx,left,right)
       return
     end if
     if (maxDepth == 0) then
  -    call argHeapsort_d1D(this, idx(left:right+1))
  +    call argHeapsort_d1D(this, idx(left:right))
       return
     end if
     imid = left + N/2
  
positive.code:   integer(i32) :: maxDepth
    integer(i32) :: imid,iPivot
    integer(i32) :: N
    N = right - left
    if (N < 16) then
      call InsertionSort(this,left,right)
      return
    end if
    if (maxDepth == 0) then
      call heapsort_d1D(this(left:right+1))
      return
    end if
    imid = left + N/2
  
negative.code:   integer(i32) :: maxDepth
    integer(i32) :: imid,iPivot
    integer(i32) :: N
    N=right-left + 1
    if (N < 16) then
      call argInsertionSort(this,idx,left,right)
      return
    end if
    if (maxDepth == 0) then
      call argHeapsort_r1D(this, idx(left:right))
      return
    end if
    imid = left + N/2
  