About the talk
Merge Sort is one of the classical sorting algorithms with O(log(N)) complexity. It is normally slower than Quick Sort, but the advantage of the algorithm that it's worst complexity is still O(log(N)), while Quick Sort has O(N^2) for the worst case.
The talk has a focus on creating a fast implementation of Merge Sort algorithm in modern C++ which leverages latest C++20 std::pmr features for fast memory allocations.
This talk will cover
- Merge sort and its canonical/naive implementation in C++, std::inplace_merge function
- std::pmr functionality of recent C++ standards, how to create a custom pmr memory resource not to allocate memory several times
- Possible implementation of merge sort algorithm in modern C++ with std::pmr
- Benchmarks to compare the results, conclusions
Web Development
About the speaker
Ivan is a Quantitative analyst with over 5 years of experience in C++. He has a strong statistical and mathematical background with focus in financial field.