Documentation

Init.Data.Array.Sort.Basic

@[irreducible]
def Subarray.mergeSort {α : Type u_1} (xs : Subarray α) (le : α → α → Bool := by exact (· ≤ ·)) :
Instances For
    @[inline]
    def Array.mergeSort {α : Type u_1} (xs : Array α) (le : α → α → Bool := by exact (· ≤ ·)) :
    Instances For