Website Summary Files Commits Branches @commit @diff @stats
path: root / Practicum / pract09
diff options
context:
space:
mode:
Commitb40d3e5186af76a278fadfe5bd528f3ea7f5ff01 (patch)
Author
 Desislava Shunina <115353472+desiish@users.noreply.github.com>
2024-12-03 17:58:11 +0200
Committer
 GitHub <noreply@github.com>
2024-12-03 17:58:11 +0200
Filesf459cb041fa6eca7b393b46b67c173bc80342fa8 /Practicum/pract09
Data-structures-and-algorithms-b40d3e5186af76a278fadfe5bd528f3ea7f5ff01.tar
Data-structures-and-algorithms-b40d3e5186af76a278fadfe5bd528f3ea7f5ff01.tar.gz
Data-structures-and-algorithms-b40d3e5186af76a278fadfe5bd528f3ea7f5ff01.zip
Parent5bbc0e54941060fa118956ac0bee417e6ea66963 (diff)
Update readme.md
1 files changed, 1 insertions, 1 deletions
-rw-r--r--Practicum/pract09/readme.md2
diff --git a/Practicum/pract09/readme.md b/Practicum/pract09/readme.md
index 3a760cd..58ee7dd 100644
--- a/Practicum/pract09/readme.md
+++ b/Practicum/pract09/readme.md
@@ -92,7 +92,7 @@ void pop_heap(RandomIt first, RandomIt last, Compare comp = Compare()) {
template <typename RandomIt, typename Compare = std::less<>>
bool is_heap(RandomIt first, RandomIt last, Compare comp = Compare()) {
- size_t size = last - first; // should usestd:: dist for when its not vector
+ size_t size = last - first; // should use std:: dist for when its not vector
for (size_t i = 0; i < size / 2; ++i) {
size_t leftChild = 2 * i + 1;