From 782a5f4e38fff0efb2ae83761e18fb829d6aa00c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Iv=C3=A1n=20Renison?=
 <85908989+IvanRenison@users.noreply.github.com>
Date: Tue, 9 Jan 2024 19:13:26 -0300
Subject: [PATCH] Add clarification on gss description (#240)

---
 content/numerical/GoldenSectionSearch.h | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/content/numerical/GoldenSectionSearch.h b/content/numerical/GoldenSectionSearch.h
index 01adbc2e3..c0d4fc3de 100644
--- a/content/numerical/GoldenSectionSearch.h
+++ b/content/numerical/GoldenSectionSearch.h
@@ -4,9 +4,10 @@
  * License: CC0
  * Source: Numeriska algoritmer med matlab, Gerd Eriksson, NADA, KTH
  * Description: Finds the argument minimizing the function $f$ in the interval $[a,b]$
- * assuming $f$ is unimodal on the interval, i.e. has only one local minimum. The maximum
- * error in the result is $eps$. Works equally well for maximization with a small change
- * in the code. See TernarySearch.h in the Various chapter for a discrete version.
+ * assuming $f$ is unimodal on the interval, i.e. has only one local minimum and no local
+ * maximum. The maximum error in the result is $eps$. Works equally well for maximization
+ * with a small change in the code. See TernarySearch.h in the Various chapter for a
+ * discrete version.
  * Usage:
 	double func(double x) { return 4+x+.3*x*x; }
 	double xmin = gss(-1000,1000,func);