wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

commit 5b62d601170e08c2cdc3a9d4384c7cd5f6f7dc8e
parent 661e6a4b8be443936679adf2763bd80cb156fcf4
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Mon, 13 Jan 2025 16:30:55 +0100

commit with codex

Diffstat:
complexity_time | 2++
linked_list | 7+++++++
list | 1+
selection_algorithm | 6++++--
sorting | 2++
5 files changed, 16 insertions(+), 2 deletions(-)

diff --git a/complexity_time b/complexity_time @@ -5,3 +5,5 @@ The [asymptotic] running time of an [algorithm] Up: [complexity_measure] See also: [complexity_space] + +Aliases: time complexity diff --git a/linked_list b/linked_list @@ -0,0 +1,7 @@ +# Linked list + +generalization: [doubly_linked_list] + +Up: [list], [data_structure] + +Aliases: linked lists diff --git a/list b/list @@ -1,5 +1,6 @@ # List +- [linked_list] - [doubly_linked_list] - [element_distinctness_problem] - [sorted_list] diff --git a/selection_algorithm b/selection_algorithm @@ -1,7 +1,9 @@ # Selection algorithm - [quickselect] +- [median_of_medians] +- [hybrid_algorithm]: [introselect] + - has [linear_time] [worst_case] [time_complexity] + - but better [average_complexity] in [practice] Up: [algorithms_list] - -See also: [median_of_medians] diff --git a/sorting b/sorting @@ -13,3 +13,5 @@ Up: [algorithms] See also: [permutation], [sorted_list] + +Aliases: sort, sorts, sorted