Can you please explain what O(n^2 \* log n) can look like? I do understand **O(n \* log n)** :

```
s=0
for(i=0; i<n; i++)
{
    for (j=1; j<n; j *= 2)
    {
        s=s+i*j;
    }

    s=s+1
}

```

when outer loop runs from 1 to n is O(n) and the inner loop repeats log(n) times per outer loop e.g j \*= 2. Also I do understand what **O(n^2)** does (performance is directly proportional to the square of the size of the input data e.g) 

```
s=0
for(i=0; i<n; i++)
{
    for (j=0; j<n; j++)
    {
        s=s+i*j;
    }

    s=s+1
}

```

but what is **O(n^2 \* log n)**? Can you please give an example.