Subject: [boost] [sort] pdqsort mini-review
From: ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ ÐÐ°Ð¹ÑÐµÐ² (mazahaka2009_at_[hidden])
Date: 2017-06-27 23:26:19
Hello. Try to send my thoughts from another email.
1. Are there any specific concerns you have about pdqsort vs. std::sort?
Â Â Â 2. Does it compile for you when you try to use it as a replacement for
Â Â Â std::sort?
Â Â Â 3. How does the performance compare on your system vs. std::sort?
Â Â Â 4. Do you think we should include pdqsort in Boost.Sort?
Â Â Â 5. Do you have any concerns about switching the default/fallback sort in
Â Â Â Boost libraries (including Boost.Sort) from std::sort to pdqsort?
1. Only that pdqsort is really better than std::sort's Introsort
2. Yes, it does.
3. Pdqsort is much faster than std::sort.
4. Yes, i do. I think that pdqsort is really good sort algorithm - it's really fast and pdqsort is already implemented sort algorithm in Rust's libcore as sort_unstable.
5. No, i have not.