Number of Comparisons (I)

Computer Science Level 2

How may comparisons are done in the following algorithm?

    // Start here

    a := 0
    for i := 1 to n
        for j := i to 1
            if j mod i := 0
                a := a+1
            j := j-1
        i := i+1
    return a

    // Stop here

Number of Comparisons (I)

This problem is a part of the set: Efficient Algorithms.