Skip to content

Fix typo std::sort_heap -> std::ranges::sort_heap #12

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
schra wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Fix typo std::sort_heap -> std::ranges::sort_heap #12

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion chapters/03_algorithms_15_heap.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.
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.