Website Summary Files Commits Branches @commit @diff @stats
path: root / Seminar09
diff options
context:
space:
mode:
Commit9951cc576ee6f1a5a3b641f9dcb5fe4af7a77b51 (patch)
Author
 Stoycho Kyosev <skyosev@192.168.100.17>
2025-01-10 07:51:51 -0500
Committer
 Stoycho Kyosev <skyosev@192.168.100.17>
2025-01-10 07:51:51 -0500
Files4d1a8bcecde627416a1b0d68d7f4641a204cce05 /Seminar09
Data-structures-and-algorithms-9951cc576ee6f1a5a3b641f9dcb5fe4af7a77b51.tar
Data-structures-and-algorithms-9951cc576ee6f1a5a3b641f9dcb5fe4af7a77b51.tar.gz
Data-structures-and-algorithms-9951cc576ee6f1a5a3b641f9dcb5fe4af7a77b51.zip
Parent00cd4d0b3541c1026a4c0f8d66d953690299178a (diff)
Parentc26ec94b0ec6f4b9429ebd91e63522dc94c9fd76 (diff)
Merge branch 'main' of https://github.com/stoychoX/Data-structures-and-algorithms
2 files changed, 5 insertions, 5 deletions
-rw-r--r--Seminar09/README.md4
-rw-r--r--Seminar09/src/priority-queue/heapsort.cpp6
diff --git a/Seminar09/README.md b/Seminar09/README.md
index 7d1f753..5de7625 100644
--- a/Seminar09/README.md
+++ b/Seminar09/README.md
@@ -4,7 +4,7 @@
## Heap sort
-# Абстрактен тип данни dictionary. Хеш таблици. Реализация на феш таблици.
+# Абстрактен тип данни dictionary. Хеш таблици. Реализация на хеш таблици.
*A common problem in computer science is the representation of a mapping between two sets.*
## Абстрактен тип данни множество (set) и речник (dictionary/map/associative array)
@@ -152,4 +152,4 @@ LoadFactor = #elements / #buckets
Където А е някакво число между 0 и 1. mod 1 изважда единствено дробната част от умножението.
* Готови хеширащи функции:
-Добрите хеширащи функции често са сложни. Съществуват готови хеширащи функции, които можем да използваме като черни кутии (MD5, SHA, ...) \ No newline at end of file
+Добрите хеширащи функции често са сложни. Съществуват готови хеширащи функции, които можем да използваме като черни кутии (MD5, SHA, ...)
diff --git a/Seminar09/src/priority-queue/heapsort.cpp b/Seminar09/src/priority-queue/heapsort.cpp
index 28e499a..cfe2840 100644
--- a/Seminar09/src/priority-queue/heapsort.cpp
+++ b/Seminar09/src/priority-queue/heapsort.cpp
@@ -58,8 +58,8 @@ void heap_sort(std::vector<int>& data)
for (size_t i = 0; i < data.size() - 1; i++)
{
- std::swap(data[0], data[current_min--]);
- heapify(data, 0, current_min);
+ std::swap(data[0], data[current_min]);
+ heapify(data, 0, current_min--);
}
}
@@ -77,4 +77,4 @@ int main()
{
std::cout << x << " ";
}
-} \ No newline at end of file
+}