SyntaxFix

[c++] How can I tell if an algorithm is efficient?

Yes you can start with the Wikipedia article explaining the Big O notation, which in a nutshell is a way of describing the "efficiency" (upper bound of complexity) of different type of algorithms. Or you can look at an earlier answer where this is explained in simple english

Examples related to c++

• Method Call Chaining; returning a pointer vs a reference? • How can I tell if an algorithm is efficient? • Difference between opening a file in binary vs text • How can compare-and-swap be used for a wait-free mutual exclusion for any shared data structure? • Install Qt on Ubuntu • #include errors detected in vscode • Cannot open include file: 'stdio.h' - Visual Studio Community 2017 - C++ Error • How to fix the error "Windows SDK version 8.1" was not found? • Visual Studio 2017 errors on standard headers • How do I check if a Key is pressed on C++

Examples related to algorithm

• How can I tell if an algorithm is efficient? • Find the smallest positive integer that does not occur in a given sequence • Efficiently getting all divisors of a given number • Peak signal detection in realtime timeseries data • What is the optimal algorithm for the game 2048? • How can I sort a std::map first by value, then by key? • Finding square root without using sqrt function? • Fastest way to flatten / un-flatten nested JSON objects • Mergesort with Python • Find common substring between two strings