Gea-Suan Lin’s technical note and murmuring :)
Posted in Computer, Joke, Murmuring, Programming, Recreation at 1:03 am by gslin
在「耐人尋味找奇數」裡面提到的方法其實還算好,O(1) :p
我記得之前有看到類似的文章,也是判斷奇數的,下面是其中一種方法 :p
int isOdd(int n) { if (n < 2) return (n != 0); else return (!idOdd(n-1)); }
Permalink
Jacky Said:
March 23, 2005 at 9:48 am
的確… 更耐人尋味…. Recursion..
Dada Said:
March 23, 2005 at 9:52 am
最後一行寫錯了, 應該是
return (!isOdd(n-1));
gslin Said:
March 23, 2005 at 10:40 am
打太快沒注意到,謝謝 :p
Name (required)
E-mail (required, never displayed)
URI
Jacky Said:
March 23, 2005 at 9:48 am
的確… 更耐人尋味…. Recursion..
Dada Said:
March 23, 2005 at 9:52 am
最後一行寫錯了, 應該是
return (!isOdd(n-1));
gslin Said:
March 23, 2005 at 10:40 am
打太快沒注意到,謝謝 :p