Asymptotic Notations:
Big O, Big Omega and Big Theta Explained (With Notes)
Code With Harry
When comparing two sorting algorithms for an array, it can be difficult to
determine which is better and by how much. In this video, we will discuss
asymptotic notation and how it can help us evaluate the efficiency of
different algorithms.
If you have not already accessed the Data Structures Algorithms playlist,
be sure to check it out in the description for all the necessary materials,
including PDF notes for this video and previous and future videos.
Asymptotic Notations
If you want to compare algorithms, you need to use asymptotic notations.
There are three primary types of asymptotic notation:
Big O
Big Theta (Θ)
Big Omega (Ω)
Let's take a closer look at the differences between these three types.
Big O, Big Omega and Big Theta Explained (With Notes)
Code With Harry
When comparing two sorting algorithms for an array, it can be difficult to
determine which is better and by how much. In this video, we will discuss
asymptotic notation and how it can help us evaluate the efficiency of
different algorithms.
If you have not already accessed the Data Structures Algorithms playlist,
be sure to check it out in the description for all the necessary materials,
including PDF notes for this video and previous and future videos.
Asymptotic Notations
If you want to compare algorithms, you need to use asymptotic notations.
There are three primary types of asymptotic notation:
Big O
Big Theta (Θ)
Big Omega (Ω)
Let's take a closer look at the differences between these three types.
