Theorems · Definition · order theory
List.insertionSort
{α : Type u_1} → (r : α → α → Prop) → [DecidableRel r] → List α → List αinsertionSort l returns l sorted using the insertion sort algorithm.
- Defined in
- Mathlib.Data.List.Sort
- Cited by
- 19 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
- Assumes
- DecidableRel
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.orderedInsertproof · cited by 23
Cited by19
Results whose statement or proof uses this declaration.
- List.pairwise_insertionSortstatement · cited by 4
- List.insertionSort_consstatement and proof · cited by 3
- List.perm_insertionSortstatement and proof · cited by 3
- List.insertionSort.congr_simpstatement and proof · cited by 1
- List.sublist_insertionSortstatement and proof · cited by 1
- List.sublist_insertionSort'statement and proof · cited by 1
- List.insertionSort_cons_of_forall_relstatement and proof · cited by 1
- List.insertionSort_nilstatement and proof · cited by 1
- List.mergeSort_eq_insertionSortstatement · cited by 1
- Multiset.sort_consproof · cited by 1
- List.mem_insertionSortstatement · cited by 1
- List.Pairwise.insertionSort_eqstatement and proof · cited by 0