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

請您先登陸，再發跟帖！