The Gateway to Computer Science Excellence
+2 votes
66 views

https://gateoverflow.in/30720/tifr2016-b-7

the above question is already discussed

but still am not clear enuf

can someone help

in Algorithms by Boss (10.2k points) | 66 views

1 Answer

0 votes

As a hint:  for analysis of asymptotic complexity, take  Log ( n! ) = n Log n.

Proof: https://stackoverflow.com/questions/2095395/is-logn-%CE%98n-logn

use this and you will easily get answer for every option.

In case you still have any query, please ask specifically what you are not able to understand.

by Junior (941 points)
0
@ask

n=m!

Taking log on both sides .

logn = log(m!)

logn=mlogm ( Using strling approximation )

 m = logn / logm

aftre this??

No related questions found

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,297 answers
198,265 comments
104,978 users