he just wants a closed form function that describes the running time of an
algorithm that takes P(N, M) steps..
an easy way to deal with factorials is to use Stirling's approximation..
using Stirling series one can derive that n! is approximately (n / e)^n *
sqrt((2*n + 1/3)*pi).. which in big-O notation is O(sqrt(n) * (n/e)^n)..
the first function I gave is good enough though..
On 12/19/06, Juliano Nunes <[EMAIL PROTECTED]> wrote:
What exactly do you need?
You need to get N and M values to calculate this permutation?
[]'s
Juliano Nunes
Estudante Embaixador Microsoft | Microsoft Certified Professional
*http://thespoke.net/blogs/juliano_netfox/*<http://thespoke.net/blogs/juliano_netfox/>
|
*http://juliano_netfox.spaces.live.com*<http://juliano_netfox.spaces.live.com/>
----- Original Message ----
From: peternilsson42 <[EMAIL PROTECTED]>
To: [email protected]
Sent: Tuesday, December 19, 2006 8:05:07 PM
Subject: [c-prog] Re: complexity of algorithm
"Yuda" <felix_fawkes@ ...> wrote:
>
> Measure the complexity
Of what...?
> from this permutation:
> P(n,m)= n!/(n-m)!
>
> I have no idea how to find out the result. help me plz!!!
http://www.google. com/search? q=complexity+
of+algorithm<http://www.google.com/search?q=complexity+of+algorithm>
--
Peter
__________________________________________________
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
http://mail.yahoo.com
--
"Hanging on in quiet desperation is the English way.."
