sad day
good, since this morning I started for testing and counting. the first fire went from 100 slices of recursive ... klikunastu seconds after the output file urusl to over 900MB! and I ran out of nadysku. try to get for a smaller amount ... say, 23 (23 September, I was born ... but 9 is zamlao so it is 23: P) recursion lasted about 45 seconds and the file with the output redirected to a 712MB urusl! okay ...
fear! no but you only die once, what will be the zoabczymy iteration! I must add that at the beginning of these two progrow outputy differ, because the iteration displays more ... clogged again, I drive the output. the repetition of both tests jescze but it just once.
Dokonałym small calculation, and I must say that I exaggerated the difference in wczescniejsza guest performance. Well, for a number of iterative operations are Sunday, February 27, 2005
How To Put A No$gba Sav In A Dstt
2 N + (N mod 2) 
-1 - (N mod 2) and for recursive
-1 - (N mod 2) and for recursive 2N
-1
, so I already can see that for N przystych number of operations is the same. I understand the concept of operations there only the number of shifts. But still, it is more efficient recursive because the iteration are various additional calculations and comparisons. Maybe later refine the algorithm. about time for testing! korazkow chose the number 32, because for 32-ch number is 4294967295 surgery in both cases, and for more than 100 kroazkow
1268 * 10 30
. I directed the output to / dev / null. no! Unless we see what it will take. :-) ... After pomade poltorejgodziny recursive further worked. oh well. niechce I already do further testing. but approximated on the basis of wczesniejsszych shorter testing, the iteration will take twice as much as recursion (for an additional porownaina, etc). no it was enough. programs and behold, just niesmiac me! recursive and iterative
. Mission Completed!
Subscribe to:
Post Comments (Atom)
0 comments:
Post a Comment