commit f23331941f5c67865ab23ca61cc05f80ba7c289c
parent b85411800c4ccc628dfbf098057fa73fa38a2bd4
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Fri, 12 Sep 2025 12:14:45 +0200
commit with codex
Diffstat:
8 files changed, 39 insertions(+), 1 deletion(-)
diff --git a/algorithms_list b/algorithms_list
@@ -17,5 +17,6 @@
- [tortoise_and_hare_algorithm]
- [stable_marriage]
- [binary_search]
+- [exponential_search]
Up: [algorithms]
diff --git a/arithmetic b/arithmetic
@@ -7,6 +7,8 @@
- [presburger_arithmetic]
- [divisibility]
- [modulo]
+- [GCD]
+- [coprime]
Up: [mathematics]
diff --git a/average b/average
@@ -4,4 +4,4 @@ relevant [academic_paper]: [hemenway1982classes]
Up: [statistics]
-See also: [expectation]
+See also: [expectation], [median]
diff --git a/binary_search b/binary_search
@@ -0,0 +1,7 @@
+# Binary search
+
+https://en.wikipedia.org/wiki/Exponential_search
+
+Up: [algorithms_list]
+
+See also: [binary_search_tree], [interpolation_search]
diff --git a/exponential_search b/exponential_search
@@ -0,0 +1,7 @@
+# Exponential search
+
+https://en.wikipedia.org/wiki/Exponential_search
+
+Up: [algorithms_list]
+
+Aliases: galloping search
diff --git a/median b/median
@@ -0,0 +1,8 @@
+# Median
+
+- [Weighted_median]
+- [Median_of_medians]
+
+See also: [average], [mediant]
+
+Up: [statistics]
diff --git a/stern_brocot_tree b/stern_brocot_tree
@@ -0,0 +1,11 @@
+# Stern-Brocot tree
+
+https://en.wikipedia.org/wiki/Stern%E2%80%93Brocot_tree
+
+Should be seen as having 0/1 to the left and 0/1 to the right: for each node you sum the numerators and the denominators ([mediant]) of the closest left node and right node
+
+Gives all [irreducible_fractions], in sorted order
+
+Up: [tree] of [rational_numbers]
+
+See also: [farey_sequence]
diff --git a/tree_binary b/tree_binary
@@ -7,3 +7,5 @@ A [tree] in which [internal_nodes] have at most two [children]
Up: [tree]
Aliases: binary tree, binary trees
+
+See also: [binary_search_tree]
