Is the time complexity of this algorithm Θ(n)?

The thing is that your formula is equivalent to theirs. You only need to know some math:

Where first 2 transformations are just basic log properties, and the third is Stirling's approximation.

And clearly everyone knows that n = Θ(n)

Alternative proof could be:

Where