Computer scienceAlgorithms and Data StructuresIntro to algorithms and data structuresUnderstanding algorithms and complexity analysis

Complexity cases and how to use them

Theory

Purpose of all cases

Report a typo

Match the best, worst, and average cases to the properties they satisfy.

Match the items from left and right columns
Best case
Average case
Worst case
This case allows for a demonstrational comparison of algorithms
Knowing this case, it is always possible to determine the efficiency of the algorithm and be sure that we will not go beyond this limit
The system is constant, and the algorithm needs good performance on unchanged input data
___

Create a free account to access the full topic