AlgoDaily - Understanding Big O Notation and Algorithmic Complexity

Quadratic Complexity

As you might guess by now-- in a function with quadratic complexity, the output steps increase quadratically with the increase in the inputs. Have a look at the following example:

xxxxxxxxxx
 
function displayAllProducts(items) {
    for (let item of items) {
        for (let innerItem of items) {
            const result = item * innerItem;
            console.log(result);
        };
    }
}
​
​
const inputs = [2, 3, 4, 5, 6, 7];
displayAllProducts(inputs);

OUTPUT

Results will appear here.