Faster C++ Sorting

C++ has included wonderful implementations of sorting algorithms over the years. Recently, with C++17 support for parallelism, sorting performance has skyrocketed by running on all of the available cores. The number of cores is predicted to grow in double-digit percentage per year, as competition between Intel and AMD heats up, giving these parallel algorithms wil to give us even faster performance.

I put together an open source repo to show how C++ sorting performance scales with the number of CPU cores. A VisualStudio 2019 solution is included, showing off not only the standard C++17 parallel sorting, but also some of my developments. These are parallel Merge Sort, and now LSD Radix Sort. Let’s see how well these perform on my six-core laptop.

 

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s