a shortcut for linux( from linux journal )
摘要: 閱讀全文posted @ 2008-03-25 19:21 丑石 閱讀(613) | 評論 (0) | 編輯 收藏
programing is a pleasure!
2008年3月25日 #
posted @ 2008-03-25 19:21 丑石 閱讀(613) | 評論 (0) | 編輯 收藏
2008年3月21日 #
posted @ 2008-03-21 12:41 丑石 閱讀(449) | 評論 (0) | 編輯 收藏
2008年3月20日 #
posted @ 2008-03-20 14:22 丑石 閱讀(212) | 評論 (0) | 編輯 收藏
2008年3月16日 #
First,Let's know the principle:
Recursive leap of faith-
When you try to understand a recursive program,you must be able to put the underlying details aside and focus instead on a single level of the operation. At that level,you are allowed to assume that any recursive call automatically gets the right answer as long as the arguments to that call are simpler than the original arguments in some respect.The psychological strategy-assuming that any simpler recursive call will work correctly-is called the recursive leap of faith!
The idea may be difficult to newers! Take an example for it:
We all know the Fibonacci function:
F(n)=F(n-1)+F(n-2)
Recursive implementation of the Fibonacci funtion:
if n is 5,Fib(5) is computed by the sum of Fib(4) and Fib(3).
Applying the faith,you can assume that the program correctly computes each of these values,without going through all the steps that Fib(4) and Fib(3) is computed!
posted @ 2008-03-16 18:54 丑石 閱讀(295) | 評論 (0) | 編輯 收藏
2007年5月30日 #
posted @ 2007-05-30 21:46 丑石 閱讀(341) | 評論 (0) | 編輯 收藏
2007年5月15日 #
People who spout off one-size-fits-all rules presume to make your design decisions without knowing your requirements. They don't know where you're going but know how you should get there.
Don't trust an answer from someone who doesn't know the question.
posted @ 2007-05-15 13:57 丑石 閱讀(260) | 評論 (0) | 編輯 收藏
posted @ 2007-05-15 13:48 丑石 閱讀(591) | 評論 (0) | 編輯 收藏
2007年5月11日 #
posted @ 2007-05-11 21:38 丑石 閱讀(475) | 評論 (0) | 編輯 收藏
2007年4月30日 #
posted @ 2007-04-30 16:44 丑石 閱讀(393) | 評論 (0) | 編輯 收藏