PHWinfo - Afficher un message

18/10/2007, 08h05

ashu <ashishmourya21@gmail.com> writes:
> there is question :
> What is the smallest value of n such that an algorithm whose running
> time is 100n2 runs faster than an algorithm whose running time is 2n
> on the same machine.
>
> i can`t understand this question plz me

Ask your instructor for . This is homework, right?

In any case, this isn't a question about the C programming language,
so I don't know why you're asking it here.

I also suspect you've quoted the question incorrectly. Is "100n2"
supposd to be 100 * n * n?

--
Keith Thompson (The_Other_Keith) kst-u@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
"We must do something. This is something. Therefore, we must do this."
-- Antony Jay and Jonathan Lynn, "Yes Minister"

18/10/2007, 08h05	#2
Keith Thompson Messages: n/a Hébergeur:	Re: time complexity ashu <ashishmourya21@gmail.com> writes: > there is question : > What is the smallest value of n such that an algorithm whose running > time is 100n2 runs faster than an algorithm whose running time is 2n > on the same machine. > > i can`t understand this question plz me Ask your instructor for . This is homework, right? In any case, this isn't a question about the C programming language, so I don't know why you're asking it here. I also suspect you've quoted the question incorrectly. Is "100n2" supposd to be 100 * n * n? -- Keith Thompson (The_Other_Keith) kst-u@mib.org <http://www.ghoti.net/~kst> San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst> "We must do something. This is something. Therefore, we must do this." -- Antony Jay and Jonathan Lynn, "Yes Minister"