Recent content by Namdosanx

laban lang paps d solusyon yung ganyang bagay tingin mo matutuwa sayo yung princess mo if makikita ka nyang nagkakaganyan?

boss may tele ka ? pa guide ako tsaka may mga few questions din ako ok lang?

up pa ba to boss goods pa?

mouse ano fb mo sir ng ma pm ka

Closed

close

try pm sa tele po baka makatulong ako may gcash merchant qr kasi ako @Namdo01

monopoly go need lang mga ka trade ng stickers guys baka nag lalaro kayo nun hehe

pa read din po ako for this year thanks

algorithm Sieve of Eratosthenes isinput: an integer n > 1.output: all prime numbers from 2 through n.let A be an array of Boolean values, indexed by integers 2 ton, initially all set to true.for i = 2, 3, 4, ..., not exceeding √n doif A is truefor j = i², i²+i, i²+2i, i²+3i, not exceeding n...

baka may makatulong dyan medyo naguguluhan ako d kasi naturo nung prof to ng maayos need to compute Space and Time Complexity

pa help naman po guys pano icompute to huhu algorithm Sieve of Eratosthenes is input: an integer n > 1. output: all prime numbers from 2 through n. let A be an array of Boolean values, indexed by integers 2 ton, initially all set to true. for i = 2, 3, 4, ..., not exceeding √n do if A is true...

need mo pa?

anong need mo malaman?