Big O: O(n^2)
23 April 2023 (Updated 24 April 2023)
In a nutshell
An algorithm is considered O(n^2)
when its runtime increases by a factor of 2n relative to the input size.
Tagged:
Big O Notation
Thanks for your comment . Once it's approved, it will appear here.
Leave a comment