What is O(n²) and O(n³) ?

Answer 1

https://stackoverflow.com/questions/9223574/is-a-sorting-algorithm-with-on3-complexity-good-or-bad&ved=2ahUKEwjGrtilrNfYAhWBWrwKHTRTCUMQFjAAegQIFRAB&usg=AOvVaw1tnfBTdhuVJqqCcSuy9Qnb

Answer 2

O(n³) is BigOh asymptotic notations
Big O is the most commonly used asymptotic notation for comparing algorithms
it is the time complexity of any sorting problem which execution time is n³
The running time of the algorithm is as a result of performing a linear operation N² times; So, it’s N multiplied by N, multiplied by N.

for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
for (int k = 0; k < n; ++k)
count++;
//@Jeremy I just give an example

Answer 3

the Big O notation is not just for sorting algorithms

Answer 4

These are Asymptotic Notations,
The languages that allow us to analyze an algorithm's running time by identifying its behavior as the input size for the algorithm increases. This is also known as an algorithm's growth rate.

Answer 5

both are asymptotic notation... but there efficiency is different