Time Complexity, Space Complexity, Asymptotic Notations - The Coding Shala

Home >> Algorithms >> Time and space complexity

Time Complexity, Space Complexity, and Asymptotic Notations

Time complexity describes the time taken by an algorithm and space complexity describes the memory used by an algorithm. Asymptotic Notations are languages that allow us to calculate time complexity and space complexity. Big O is most commonly used for time complexity or analysis of algorithms.

Time Complexity

In Computer Science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input. The time complexity of an algorithm is commonly expressed using big O notation, which excludes coefficients and lowers order terms.[From Wikipedia] In a simple way we can say how much time our code takes to execute. 

So, How to calculate the running time of an algorithm?
We can have three cases to analyze an algorithm:
  1. Worst Case
  2. Average Case
  3. Best Case
Generally, we calculate the worst-case to show the time complexity of an algorithm. In the worst-case analysis, we calculate the upper bound on the running time of an algorithm. Here, upper bound means our code won't take more time than we have described for it.

Asymptotic Notations

Asymptotic notations are mathematical tools to represent the time complexity of the algorithm. The following 3 asymptotic notation is mostly used to represent the time complexity of the algorithm.

Theta Notation(Θ):

The theta notation bounds a function from above and below, so it defines exact asymptotic behavior. For a given function g(n), we denote Θ(g(n)) is following set of functions.


Θ(g(n)) = {  f(n): there exist positive constants c1, c2 and n0 such that 

                   0 <= c1*g(n) <= f(n) <= c2*g(n)

                   for all n >= n0 }



The above definition means, if f(n) is theta of g(n), then the value f(n) is always between c1*g(n) and c2*g(n) for large values of n (n >= n0). The definition of theta also requires that f(n) must be non-negative for values of n greater than n0.

Big O Notation(O):


The Big O notation defines an upper bound of an algorithm, it bounds a function only from above.



O(g(n)) = {   f(n): there exist positive constants c and 
                    n0 such that 0 <= f(n) <= cg(n) for 
                    all n >= n0  }

Omega Notation(Ω):


Omega(Ω) notation provides an asymptotic lower bound. 

Ω(g(n)) = {   f(n): there exist positive constants c and
                    n0 such that 0 <= cg(n) <= f(n) for
                    all n >= n0 }
Asymptotic Notations - The Coding Shala
Let's see how to use these asymptotic notations.

Some rules to the analysis of loops

The following are some rules good to be remembered while we work with loops:
  • The time complexity of a function is considered as O(1) if it doesn't contain a loop.
  • The time complexity of a loop is considered as O(n) if the loop variables are incremented/decremented by a constant amount.
  • The time complexity of nested loops is equal to the number of times the innermost statement is executed. 
  • Time Complexity of a loop is considered as O(Logn) if the loop variables are divided/multiplied by a constant amount.
  • Time Complexity of a loop is considered as O(LogLogn) if the loop variables are reduced/increased exponentially by a constant amount.
  • When there are consecutive loops, we calculate time complexity as the sum of time complexities of individual loops.

Space Complexity

Space Complexity of an algorithm is the total space taken by the algorithm with respect to the input size. Space complexity includes both Auxiliary space(extra space or temporary space used by an algorithm) and space used by input.

Time and Space Complexity Example

Example 1:
What is the time, space complexity of the following code?

int a = 0, b = 0; 
for (i = 0; i < N; i++) {
a = a + rand(); 
}
for (j = 0; j < M; j++) {
b = b + rand();


}
Assume that rand() is O(1) time, O(1) space function.

Solution: O(max(N,M)) or we can say O(N+M) time, O(1) space.


Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more

N-th Tribonacci Number Solution - The Coding Shala

Home >> Programming >> N-th Tribonacci Number  Hey there, welcome back to another post. In this post, we will learn how to solve the N-th Tribonacci Number problem and will implement its solution in Java. N-th Tribonacci Number Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn.  Example 1:  Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 N-th Tribonacci Number Java Solution using Bottom-Up DP This problem is similar to the Fibonacci series. We can solve it using the Bottom-Up approach of dynamic programming. Time Complexity: O(n) Space Complexity: O(n) The space complexity can be reduced to O(1) by using variables to store the previous three values instead of using an array. Java Program:  class Solution { public int tribonacci( int n) { if (n == 0) return 0; ...
Read more

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y...
Read more

LeetCode - Shuffle the Array Solution - The Coding Shala

Home >> LeetCode >> Shuffle the Array  In this post, we will learn how to solve LeetCode's Shuffle the Array problem and will implement its solution in Java. Shuffle the Array Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. Example 1: Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7]  Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7]. Example 2: Input: nums = [1,2,3,4,4,3,2,1], n = 4 Output: [1,4,2,3,3,2,4,1] Practice this problem on LeetCode: Click Here. Shuffle the Array Java Solution Approach 1: Using a new Array. Space complexity: O(n). Java Program:  class Solution { public int [] shuffle ( int [] nums , int n ) { int [] ans = new int [ 2 * n ]; int j = 0 ; for ( int i = 0 ; i < 2 * n ; i = i + 2 ){ ans [ i ] = nums [ j ]; ans...
Read more

Introduction to Kotlin Programming Language for Backend Development - The Coding Shala

Home >> Learn Kotlin >> Kotlin Introduction Are you looking for a powerful and reliable programming language for backend development? Look no further than Kotlin. Kotlin is a modern, statically typed programming language that has gained a lot of popularity in recent years. In this blog post, we'll take a look at what Kotlin is and why it's a great choice for backend development. What is Kotlin? Kotlin is a statically typed, cross-platform, general-purpose programming language that was developed by JetBrains in 2011. It is designed to be more concise, expressive, and safe than Java, the most widely used programming language for Android development. Kotlin can be compiled to run on the Java Virtual Machine (JVM), JavaScript, and native platforms, making it a versatile language for different types of applications. Why use Kotlin for backend development? Kotlin has several features that make it a suitable language for backend development, such as: Concisenes...
Read more