Computational complexity (analysis) is a unit of measurement for the number of resources an algorithm uses in computer science. Regardless of the language, technical platform, or hardware used to implement an algorithm, algorithmic analysis is a method for assessing how quickly it executes. time complexity of sorting algorithms | time complexity of linear search