From 7b7f350da557015b1319eead44b4a965d77d5b4c Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Andr=C3=A9=20Schr=C3=B6der?= Date: Sat, 11 Feb 2023 20:23:52 +0100 Subject: [PATCH] Fix typo std::sort_heap -> std::ranges::sort_heap Line 20 is: ``` std::ranges::sort_heap(result, std::greater<>{}); ``` --- chapters/03_algorithms_15_heap.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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