Merge remote-tracking branch 'LSchwerdt/pagedmergesort' into pagedmergesort

Author: LSchwerdt

src/SortingAlgorithms.jl

@@ -685,6 +685,7 @@ end
 ###
 
 # merge v[lo:hiA] and v[hiA+1:hi] ([A;B])  using buffer t[1:1 + hi-lo]
+# this is faster than merge! but requires twice as much auxiliary memory.
 function twoended_merge!(v::AbstractVector{T}, t::AbstractVector{T}, lo::Integer, hiA::Integer, hi::Integer, o::Ordering) where T
     @assert lo <= hiA <= hi
     loA = lo
@@ -748,7 +749,7 @@ function twoended_merge!(v::AbstractVector{T}, t::AbstractVector{T}, lo::Integer
         # copy back from t to v
         offset = lo-1
         len = 1 + hi - lo
-        @inbounds for i = 1:len
+        for i = 1:len
             v[offset+i] = t[i]
         end
     end