Computer Science

What is Asymptotic Notation & Big-Oh Notation?

What is Asymptotic Notation? Whenever we want to perform an analysis of an algorithm, we need to calculate the complexity of that algorithm. But when we calculate the complexity of an algorithm it provides a different amount of resource required. So instead of taking the exact amount of resources, we represent that complexity in a […]

What is Big-Omege Notation (Ω) & Big-Theta Notation (Θ)?

What is Big-Omege Notation (Ω)? Big-Omega notation defines the lower bound of an algorithm in terms of Time Complexity.That means Big-Omega notation always indicates the minimum time an algorithm requires for all input values. That means Big-Omega notation describes the best case of an algorithm time complexity.Big-Omega Notation can be defined as follows… Consider function f(n) as

Time Complexity & Space Complexity of Algorithm

The efficiency of an algorithm depends on two parameters: Time Complexity: Time Complexity is defined as the number of times a particular instruction set is executed rather than the total time taken. It is because the total time taken also depends on some external factors like the compiler used, the processor’s speed, etc. Space Complexity: Space Complexity

Scroll to Top