I don't know if I'm on the right track, perhaps someone can give me
some pointers. Thanks.
1b) Since algorithm A is of O(2n^3), and it can solve a problem of size
n = 20 in one
hr, then by substituting n = 20 into the equation, we have that A
performs
2 * (20 ^ 3) = 16000 operations in 1 hr.
t
Hi guys,
I'm preparing for my exams and have been stuck at this problem for a
while now, i know my maths is really poor, would really appreciate some
pointers.
if algorithm A is of O(2n^3) and algorithm B is of O(2^n + n^2) and if
A is guaranteed to solve a problem of size n = 20 in 1 hr, then w
Dear member
Looking for games,hardware,software, PCs, LAPTOPs, priders, Xbox, PS 2,
3, DS
http://www.clubshop.com/cgi/appx.cgi/3440162
Sign up now for free and find the best prices and spesial offers.
http://www.clubshop.com/cgi/appx.cgi/3440162
>1000 companies.
DELL
APPLE store
HP
SONY
A
The only supervision is to let my friends timely report which pieces
they have downloaded, so I will know when they can quit the swarm and
serve just me.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Ge
I haven't seen the real world performance of this idea. I may contact
some interested programmers and do some experiments.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this gro
I think this is a good idea, esp if lot of people are ready to
co-operate. Though you might need to change or write a new client to
include the co-operation bit. Does any client today allow you to
download a specified portion of a file instead of the entire file ?
Do you plan to modify/write suc
Let's say it works - and it's faster, also.
But now the data you want is spread out still across a few different
machines. You'd still have to:
1) download each friend's part of the total download,
and
2) then re-assemble the download back together again.
Also, I don't view the co-ordinated d
