Time Complexity Part-2

Types of Time Complexity Analysis :

1) Worst Case Time Complexity: It is that case where the algorithm takes the longest time to complete its execution It is represented by the Big-O notation. By default we calculate the worst case time complexity when we refer to the time complexity of a code.

2) Best Case Time Complexity: It is that case where the algorithm takes the least time to complete its execution It is represented by the Omega Notation (Ω-Notation).

3) Average Case Time Complexity: As the name suggests, it Gives average time for a program to complete its execution¶ It is represented by the theta notation (Θ-Notation).

Here are time complexities of some famous and most used algorithms :

so hope you guys now have a good hand on time complextiy in the next part there will be just examples till then comment on which topic you want next blog and follow me on instagram and linkedin.