-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
adak wrote:
> Good luck. Quite a challenge. Personally, I'd ditch mentioning your
> year of birth. Totally irrelevent to your project. Act mature and
> respectful and you'll be (generally), treated the same way. Still, keep
> a healthy and thick "ski
You've come into the wrong forum, Paul.
Your answer doesn't involve an algorithm, but a collection of several
of them.
I'd suggest taking your question to one of the usenet (newsgroup)
forums which are dedicated to programming in the language you really
want to write your OS in.
And of course,
Hello. My Name Is Paul I Was Born In `1993 And I Know C/C++
And Python Some Others Apply But Are Not Importent...
I Wonted Help Making An OS I Know The Basics And I Have
Alot Of Computer Knolladge. I Spend My Whole Summer Devoted
To Programming And Learning...
I Just Need Some One To Help Me Make
Vibhu wrote:
> How wud you handle the case where
>
> X= {1, 3, 5, 7, 9}
> Y= {2,4,6,8}
>
> What wud be timecomplexity ?
Here is a more general solution, covering cases
like your example where X and Y have different
dimensions:
Let Nx be dimension of X, Ny dimension of Y
(assume Nx >= Ny > 0)
H
Even the straightforward factorial function required a fixed number of
steps which is O(n!). Caching previous results is a significant
optimization, but it would mean being able to store say n! for all n <
321. Then compute n! as n * (n-1)!. But even then it is asymptotically
the same running time
W Karas wrote:
> Manu wrote:
> > Median of 2 combined array X[1...n] and Y[1...n] sorted.
> > Find o(lgn) algo to find the median of all 2n elements in the 2 array.
> >
> > Well I tried and came up with this solution...if somebody has some
> > other way plz tell..thnx in advance
> >
> > we ca
How wud you handle the case where
X= {1, 3, 5, 7, 9}
Y= {2,4,6,8}
What wud be timecomplexity ?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeek
yeah, I think approximation is the way to go.Striling's approximation gives you upper and lower bounds on factorials. and these are very tight bounds.And the best thing about approximations is, they require a fixed no of operations.
On 5/3/06, BiGYaN <[EMAIL PROTECTED]> wrote:
To get the factorial
