OpenSource/aca-tasks
3
0
Fork 0
Code Packages Projects Releases Activity

Compare commits

base: OpenSource:0c31a3c24e9f048b2cf3f8bc0836ddcc08319a03
Branches Tags
OpenSource:master
OpenSource:rd-task3
OpenSource:explanations
...
compare: OpenSource:2665332f7043400528e1af5aca10dcc318d6c582
Branches Tags
OpenSource:master
OpenSource:rd-task3
OpenSource:explanations

2 Commits
0c31a3c24e ... 2665332f70

Author SHA1 Message Date
robtor
2665332f70 fix execution 2023-12-05 22:36:19 +01:00
robtor
a47714d8b6 fix execution 2023-12-05 22:36:06 +01:00
1 changed files with 3 additions and 3 deletions
Show Stats Expand all files Collapse all files

6
task2/include/quicksort_mt.h
View File

@ -3,6 +3,7 @@
#include <thread> #include <thread>
#include <mutex> #include <mutex>
#include <functional> #include <functional>
#include <assert.h>
template<typename T> template<typename T>
class QuickSorterMT { class QuickSorterMT {
@ -49,8 +50,7 @@ private:
return; return;
} }
} }
auto pivot = *std::next(data.begin(), std::distance(data.begin(), data.end()) / 2);
auto pivot = data[std::distance(data.begin(), data.end()) / 2];
auto m1 = std::partition(data.begin(), data.end(), [pivot, this](const auto &em) { auto m1 = std::partition(data.begin(), data.end(), [pivot, this](const auto &em) {
return this->cmp(em, pivot); return this->cmp(em, pivot);
@ -61,7 +61,7 @@ private:
}); });
auto left = data.subspan(0, m1 - data.begin()); auto left = data.subspan(0, m1 - data.begin());
auto right = data.subspan(m2 - data.begin(), data.size()); auto right = data.subspan(m2 - data.begin());
if (depth < mdepth) { if (depth < mdepth) {
std::thread left_thread([&]() { qsort(left, depth + 1, mdepth); }); std::thread left_thread([&]() { qsort(left, depth + 1, mdepth); });