Question

Discuss Algorithmic complexity and its types.

Answer 1

The complexity of an algorithm f(n) gives the running time and/or the storage space required by the algorithm in terms of n as the size of input data.

Time Complexity:
The Time complexity of an algorithm is given by the number of steps taken by the algorithm to complete the process.

Space Complexity:
The space complexity of an algorithm is the amount of memory required to run to its completion.