retagged by
241 views

1 Answer

Related questions

0 votes
0 votes
1 answer
2
3 votes
3 votes
3 answers
3
radha gogia asked Oct 5, 2015
2,344 views
F1 =(logn)! F2=(log(n!)) F3 = (logn)^logn Just one query n! would be a constant rght , so in F1 we are taking factorial of a constant while in second one we are taking lo...
0 votes
0 votes
2 answers
4
dragonball asked Aug 2, 2018
393 views
How the slowness and the fastness of any algorithm depends ?Is (n/logn) is slower than log(logn) ?