Chapter 3. Prime Factorization. Complexity.

[unclelesha]

function primeFactors(n){
    // Print the number of 2s that divide n
    while (n % 2 == 0) {
        console.log(2);
        n = n/2;
    }

    // n must be odd at this point. So we can skip one element
    // (Note i = i +2)
    for (var i = 3; i * i <= n; i = i + 2) {
        // While i divides n, print i and divide n
        while (n % i == 0) {
            console.log(i);
            n = n / i;
        }
    }
    // This condition is to handle the case when n is a prime number
    // greater than 2
    if (n > 2) {
        console.log(n);
    }
}

This function has Big-O =

In your book you put it sqrt(x) only, but inside of the for loop there is another loop while, that has Big-O = log (x). Am I correct?