Loading…
Attending this event?
View analytic
Wednesday, September 26 • 15:15 - 15:45
A Little Order: Delving into the STL sorting algorithms

Sign up or log in to save this to your schedule and see who's attending!

Benchmarking STL sorting algorithms can lead to surprises. For example, std::partial_sort takes considerably more time to sort half a vector than std::sort to sort it completely...
Starting from this counter-intuitive result, we'll engage on a journey where we'll look at the standard, read implementations of the STL and benchmark code to understand how std::sort, std::nth_element and std::partial_sort are implemented and why. In the process, we'll see some of the challenges STL implementers encountered and how they chose to overcome them.
This session is targetted at STL users who are curious to know how their tool are working.

Speakers
avatar for Frederic TINGAUD

Frederic TINGAUD

Principal Software Engineer, Murex
Fred Tingaud is the creator of quick-bench.com. | He is also a Principal Software Engineer at Murex where he works on UI and front-end APIs. | His interests range from code efficiency and readability to UI ergonomics.


Wednesday September 26, 2018 15:15 - 15:45
D

Attendees (39)