About this document
Understanding Time and Space Complexity by Aryan Apte is a document available to read on EtoBox.
Time complexity describes how long an algorithm takes to run based on input size, while space complexity describes how much memory is used. Asymptotic notation like Big-O, Ω, and Θ are used to classify algorithms by their rate of growth as input increases. Common time complexities from fastest to slowest are constant, logarithmic, linear, n log n, quadratic, and cubic. Space complexity depends on the auxiliary space used by the algorithm.
- Author
- Aryan Apte
- Language
- EN