Meaning of lg * N in Algorithmic Analysis

Question

I\'m currently reading about algorithmic analysis and I read that a certain algorithm (weighted quick union with path compression) is of order N + M lg * N. Apparently though th

Answer 1

Logarithm is denoted by log or lg. In your case I guess the correct interpretation is N + M * log(N).

EDIT: The base of the logarithm does not matter when doing asymptotic complexity analysis.