Algorithm Analysis
Everything on SkillVeris tagged Algorithm Analysis — collected across the glossary, study notes, blog, and cheat sheets.
4 resources across 1 library
Interview Questions(4)
What is Big O Notation?
Big O notation describes how an algorithm’s running time or memory usage grows as the input size grows, focusing on the dominant term and ignoring constant fac…
What is the Difference Between Time and Space Complexity?
Time complexity measures how the number of operations an algorithm performs grows with input size, while space complexity measures how the memory it needs grow…
What is the Master Theorem?
The Master Theorem gives a direct formula for the time complexity of divide-and-conquer recurrences of the form T(n) = a·T(n/b) + f(n), by comparing f(n) again…
What is a Recurrence Relation in Algorithm Analysis?
A recurrence relation expresses the running time of a recursive algorithm as a function of its running time on smaller inputs, such as T(n) = 2T(n/2) + O(n) fo…