Analysis of algorithms is the study of the resources required to execute an algorithm, especially time, memory, and other computational costs. It commonly expresses how resource use changes with input size, enabling comparison of algorithms through time complexity and space complexity.
The determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them. Usually, this involves determining a function that relates the length of an algorithm's input to the number of steps it takes (its time complexity) or the number of storage locations it uses (its space complexity).