it could be a good interview question

来源: streetwalker 于 2009-05-05 08:04:36 [] [旧帖] [给我悄悄话] 阅读数 : (125 bytes)

I can only think of 1 solution that is to use a for loop to try the dividability from 2 to sqrt(n). What's the 2nd solution?

所有跟帖： 

• very interesting, thanks -streetwalker- ♂ 给 streetwalker 发送悄悄话 (241 bytes) () 05/05/2009 postreply 11:36:50

请您先登陆，再发跟帖！