Measuring elapsed time accurately in C++ can be crucial for performance tuning and analyzing how long a particular piece of code takes to execute. The C++ standard library provides various options for accurately measuring time, such as using std::chrono
facilities.
#include <iostream>
#include <chrono>
int main() {
// Start timing
auto start = std::chrono::high_resolution_clock::now();
// Code block to measure
for (volatile int i = 0; i < 1000000; ++i); // Simulate work
// End timing
auto end = std::chrono::high_resolution_clock::now();
// Calculate elapsed time
std::chrono::duration<double> elapsed = end - start;
// Output the elapsed time
std::cout << "Elapsed time: " << elapsed.count() << " seconds" << std::endl;
return 0;
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?