Algorithmic efficiency is a property of an algorithm that relates to the amount of computational resources used by the algorithm. It’s a measure of how well an algorithm performs in terms of time and space, which are the two main measures of efficiency.
Consider an algorithm for sorting a list of integers. If the algorithm has a time complexity of O(n log n), where n is the size of the list, it means that the algorithm’s efficiency improves as the list size increases. This is because the algorithm’s time usage grows slower than the size of the input data.