n ! is approximately equals to n^n.
Hence, log( n !) = log(n^n) = n logn
Now, Recurrence Relation will be:
T(n) = 100 T (n/99) + nlog(n)
Comparing with General Recurrence Relation:
T(n) = a T( n / b) + n^k.log^(p)n
a =100 , b = 99 , k = 1 , p = 1
a > b^k
So, O(n^log 100 base 99)
log 100 base 99 is approximate equals to 1.
Hence, O(n).
Plz make me correct if i m wrong...