@[inline]

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

Sorts an array using the Quicksort algorithm.

The optional parameter lt specifies an ordering predicate. It defaults to LT.lt, which must be decidable to be used for sorting. Use Array.qsortOrd to sort the array according to the Ord α instance.

The optional parameters low and high delimit the region of the array that is sorted. Both are inclusive, and default to sorting the entire array.

Equations

• One or more equations did not get rendered due to their size.

@[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

Equations

• One or more equations did not get rendered due to their size.

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

Sorts an array using the Quicksort algorithm, using Ord.compare to compare elements.

Equations

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