Algorithms: parallel and merge

This month we welcome back Ervin Bosenbacher and Denis Yaroshevskiy.

***************
Please sign up on the Skills Matter site, too:
https://skillsmatter.com/meetups/11376-c-plus-plus-london-december
***************

Agenda:

"Parallel execution of STL algorithms in c++17 and beyond" - Ervin Bosenbacher

(abstract TBA)

"Merging big with small" - Denis Yaroshevskiy

std::merge is designed to work well for the case when two input ranges have roughly the same size. This talk presents a merge algorithm that will also perform well when the first range is much bigger.

---

About the speakers:

Ervin is a freelancer and contractor who is doing research and development of an embedded distributed search and classification engine. Before starting research and development, Ervin has helped tier one banks, asset management companies and startups to design and develop various applications and systems related to cyber security, search engines, front end trading or big data related systems as well as feature extraction and object recognition in images and videos. Ervin enjoys his family, movies and music in his free time.

During the day Denis is a senior software developer at Bloomberg. He is also an occasional contributor to libc++ and Chromium, in particular he is responsible for Chromium's implementation of flat_set.