From 1fb0725fe7ebd4ec9d5be1385f96c5f2fa933b44 Mon Sep 17 00:00:00 2001
From: Misha S <43847934+mishasweetpie@users.noreply.github.com>
Date: Sat, 17 Feb 2024 05:57:42 +0700
Subject: [PATCH] Use lower bound in notes for partition_point

---
 chapters/03_algorithms_05_divide.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/chapters/03_algorithms_05_divide.tex b/chapters/03_algorithms_05_divide.tex
index 98e8c51..185c32f 100644
--- a/chapters/03_algorithms_05_divide.tex
+++ b/chapters/03_algorithms_05_divide.tex
@@ -57,7 +57,7 @@ \subsection{\texorpdfstring{\cpp{std::equal_range}}{\texttt{std::equal\_range}}}
 \subsection{\texorpdfstring{\cpp{std::partition_point}}{\texttt{std::partition\_point}}}
 \index{\cpp{std::partition_point}}
 
-Despite the naming, \cpp{std:partition_point} works very similarly to \texttt{std::upper\-\_bound}, however instead of searching for a particular value, it searches using a predicate.
+Despite the naming, \cpp{std:partition_point} works very similarly to \texttt{std::lower\-\_bound}, however instead of searching for a particular value, it searches using a predicate.
 
 \cppversions{\texttt{partition\_point}}{\CC11}{\CC20}{N/A}{\CC20}
 \constraints{\texttt{forward\_range}}{}{N/A}{\texttt{unary\_predicate}}