How to make std::sort faster?
In this video I use a quantitative approach based on Google Benchmark library to analyze various techniques to improve the performance of std::sort.
We evaluate QuickSort, IntroSort, parallel QuickSort, and parallel IntroSort.
You can quickly set up and use Google benchmark by downloading my repo from here:
https://github.com/ourarash/cpp-template
Learn more about this repo at: • How to use Google Benchmark for C++ programs
Learn more about Google Benchmark: • How to use Google Benchmark for C++ programs
-----------------------------------------------------
Check my other videos on:
Learn C++ Multi Threading in 20 Minutes: • Learn C++ Multi Threading in 20 Minutes
Bazel and unit tests with GTest: • Bazel & Google Test in Visual Studio Code
Debugging in Visual Studio Code for C++: • Debugging C++ in Visual Studio Code using ...
Visual Studio Code, Top Features: • Visual Studio Code Top Features 2020
-----------------------------------------------------
Installing Bazel: https://docs.bazel.build/versions/3.2...
More info on Google Benchmark Framework: https://github.com/google/benchmark
-----------------------------------------------------
Keep in touch with me:
/ ourarash
I'm the founder of BitcoinCrazyness app, the Most Advanced Cryptocurrency mobile APP for alerts, Check it out:
http://www.bitcoincrazyness.com/