Here is the video in question:https://www.youtube.com/watch?v=BpiMRyWoDu0&t=131s
F(n) and g(n) are both equal to each other since they both have a time complexity of n^2
What's the point of applying the constant c to g(n) to make it 2n^2? What is this trying to show us?
Additionally, why does the inequality include 'equal to'? When will 2n^2 ever be equal to n^2 + n + 3?
Further more, why has he written n >= 4? Where did the 4 come from? I understand why he wrote n >= 3 because n(n-1)is the same as n for time complexity purposes, therefore this becomes n >= 3