Skip to content

About Complexity Analysis

Devrath edited this page Jun 18, 2021 · 1 revision

The Complexity in terms of space and time meaning

  • The complexity determines how the time and space attributes of an algorithm modify when the inputs of a program change.
  • Using the complexity analysis, we measure how the algorithm behaves and how efficient is it.

Type of complexities involved in a program

Complexity-type Description
Time Complexity This involves how much approximate time it would take to execute a program if the size of the input increases
Space Complexity This involves how much approximate space meaning the system resources such as memory it would take to execute a program if the size of the input increases
Clone this wiki locally