found in O(n^2)....time using the recurrence nCm=nCm-1+n-1Cm-1 and find m! in O(m) so u ve the result in O(n^2) time simple,no????
regards 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://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 -- Peter __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com Send free SMS to your Friends on Mobile from your Yahoo! Messenger. Download Now! http://messenger.yahoo.com/download.php
