@[inline]

def Array.qsort {α : Type u_1} (as : Array α) (lt : α → α → Bool := by exact (· < ·)) (low : Nat := 0) (high : Nat := as.size - 1) : Array α

@[irreducible, specialize #[]]

def Array.qsort.sort {α : Type u_1} (lt : α → α → Bool := by exact (· < ·)) {n : Nat} (as : Vector α n) (lo hi : Nat) (hlo : lo < n := by omega) (hhi : hi < n := by omega) : Vector α n

def Array.qsortOrd {α : Type u_1} [ord : Ord α] (xs : Array α) : Array α

Sort an array using compare to compare elements.

Equations

• xs.qsortOrd = xs.qsort fun (x y : α) => (compare x y).isLT