diff --git a/chapters/03_algorithms_15_heap.tex b/chapters/03_algorithms_15_heap.tex
index e2db31d..c8965b5 100644
--- a/chapters/03_algorithms_15_heap.tex
+++ b/chapters/03_algorithms_15_heap.tex
@@ -90,4 +90,4 @@ \subsection{Comparison with \texorpdfstring{\cpp{std::priority_queue}}{\texttt{s
 \cppfile{code_examples/extras/priority_queue_heap_code.h}
 \end{codebox}
 
-When using the heap algorithms, we need to manually manage the underlying data structure (lines 9-10 and 13–14). However, we do not need to extract the data, and on top of that, we could omit the final \cpp{std::sort_heap} (line 20) if we do not need the top k elements in sorted order.
\ No newline at end of file
+When using the heap algorithms, we need to manually manage the underlying data structure (lines 9-10 and 13–14). However, we do not need to extract the data, and on top of that, we could omit the final \cpp{std::ranges::sort_heap} (line 20) if we do not need the top k elements in sorted order.
\ No newline at end of file