Algorithm complexity (performance) :

• Algorithm complexity refers to the analysis of an algorithm performance in terms of time and space requirement as a function of input size .

Space complexity :

• Total amount of memory required by an algorithm for its completed execution called space complexity.

Constant space complexity :

Linear space complexity :

Time complexity :

• The total amount of the time require buyer algorithm to its complete execution call time complexity .
• It’s sometimes depends on System or Input .

Linear time complexity :

Best case : O (1) Bigo of one

worst case : O(N) Bigo of n

N= > size of the array