• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            隨筆-60  評論-98  文章-0  trackbacks-0

            Rob Pike, 是AT&T Bell Lab前Member of Technical Staff ,現(xiàn)在google研究操作系統(tǒng),Unix先驅(qū),UTF-8的設(shè)計人,The Unix Programming Environment 和 The Practice of Programming 的作者之一。 在《 Notes on C Programming 》中從另一個稍微不同的角度表述了 Unix 的哲學(xué)(或者說是程序局部優(yōu)化6原則):

            1. 你無法斷定程序會在什么地方耗費(fèi)運(yùn)行時間。瓶頸經(jīng)常出現(xiàn)在想不到的地方,所以別急于胡亂找個地方改代碼,除非你已經(jīng)證實(shí)那兒就是瓶頸所在。
            2. 估量。在你沒對代碼進(jìn)行估量,特別是沒找到最耗時的那部分之前,別去優(yōu)化速度。
            3. 花哨的算法在 n 很小時通常很慢,而 n 通常很小。花哨算法的常數(shù)復(fù)雜度很大。除非你確定 n 總是很大,否則不要用花哨算法(即使 n 很大,也優(yōu)先考慮原則 2 )。比如,解決常見問題時,最簡單的樹——二叉樹(binary tree),總是比那些復(fù)雜的樹(AVL樹,伸展樹(splay tree)和紅黑樹、B-樹(B-tree),多叉樹(trie))來的高校。
            4. 花哨的算法比簡單算法更容易出 bug 、更難實(shí)現(xiàn)。盡量使用簡單的算法配合簡單的數(shù)據(jù)結(jié)構(gòu)。
            只要掌握了數(shù)據(jù)結(jié)構(gòu)中的四大法寶,就可以包打天下,他們是:array 、linked list 、hash table、binary tree 。這四大法寶可不是各自為戰(zhàn)的,靈活結(jié)合才能游刃有余。比如,一個用hash table組織的symbol table,其中是一個個由字符型array構(gòu)成的linked list。
            5. 以數(shù)據(jù)為中心。如果已經(jīng)選擇了正確的數(shù)據(jù)結(jié)構(gòu)并且把一切都組織得井井有條,正確的算法也就不言自明。編程的核心是數(shù)據(jù)結(jié)構(gòu),而不是算法。
            6. 沒有原則 6 。

            Ken Thompson —— Unix 最初版本的設(shè)計者和實(shí)現(xiàn)者,禪宗偈語般地對 Pike 的原則4 作了強(qiáng)調(diào):
            拿不準(zhǔn)就窮舉

            附:E文原文(節(jié)選自《Notes on C Programming 》Rob Pike, February 21, 1989 )
            E文全文地址:http://www.lysator.liu.se/c/pikestyle.html
                  Most programs are too complicated - that is, more complex than they need to be to solve their problems efficiently.  Why? Mostly it's because of bad design, but I will skip that issue here because it's a big one.  But programs are often complicated at the microscopic level, and that is something I can address here.
                  Rule 1.  You can't tell where a program is going to spend its time.  Bottlenecks occur in surprising places, so don't try to second guess and put in a speed hack until you've proven that's where the bottleneck is.

                  Rule 2.  Measure.  Don't tune for speed until you've measured, and even then don't, unless one part of the code overwhelms the rest.

                  Rule 3.  Fancy algorithms are slow when n is small, and n is usually small.  Fancy algorithms have big constants. Until you know that n is frequently going to be big, don't get fancy.  (Even if n does get big, use Rule 2 first.)   For example, binary trees are always faster than splay trees for workaday problems.

                  Rule 4.  Fancy algorithms are buggier than simple ones, and they're much harder to implement.  Use simple algorithms as well as simple data structures.

                  The following data structures are a complete list for almost all practical programs:

            array
            linked list
            hash table
            binary tree
            Of course, you must also be prepared to collect these into compound data structures.  For instance, a symbol table might be implemented as a hash table containing linked lists of arrays of characters.
                  Rule 5.  Data dominates.  If you've chosen the right data structures and organized things well, the algorithms will almost always be self­evident.  Data structures, not algorithms, are central to programming.  (See Brooks p. 102.)

                  Rule 6.  There is no Rule 6.

            posted on 2008-02-29 08:39 創(chuàng)建更好的解決方案 閱讀(4486) 評論(4)  編輯 收藏 引用 所屬分類: E文全翻心路歷程C++專欄軟件設(shè)計

            評論:
            # re: 我是笨人——讀Rob Pike的《Notes on C Programming 》(附全文鏈接)[未登錄] 2008-02-29 09:41 | cppexplore
            非常不錯!這6個原則概括的還真是精辟!  回復(fù)  更多評論
              
            # re: 我是笨人——讀Rob Pike的《Notes on C Programming 》(附全文鏈接)[未登錄] 2008-02-29 09:42 | cppexplore
            非常不錯!這6個原則概括的還真是精辟!  回復(fù)  更多評論
              
            # re: 我是笨人——讀Rob Pike的《Notes on C Programming 》(附全文鏈接) 2008-02-29 18:32 | comiunknown
            5. 以數(shù)據(jù)為中心。如果已經(jīng)選擇了正確的數(shù)據(jù)結(jié)構(gòu)并且把一切都組織得井井有條,正確的算法也就不言自明。編程的核心是數(shù)據(jù)結(jié)構(gòu),而不是算法。

            這條雙手雙腳贊一個^_^  回復(fù)  更多評論
              
            # re: 我是笨人——讀Rob Pike的《Notes on C Programming 》(附全文鏈接) 2008-02-29 21:01 | 嘯天豬
            UTF-8的設(shè)計者是Ken Thompson,Rob Pike大概是第一時間見證了Ken Thompson設(shè)計UTF-8的過程  回復(fù)  更多評論
              
            亚洲国产精品成人久久蜜臀| 99久久777色| 欧美久久一级内射wwwwww.| 色欲综合久久躁天天躁| 久久精品国产一区二区三区| 久久人做人爽一区二区三区| 久久夜色精品国产亚洲| 中文字幕乱码人妻无码久久| 无码精品久久一区二区三区| 少妇精品久久久一区二区三区| 久久亚洲国产成人影院| 久久久久人妻精品一区三寸蜜桃| 久久人人爽人人爽人人av东京热| 久久97精品久久久久久久不卡| 精品永久久福利一区二区| 久久WWW免费人成一看片| 久久精品国产精品青草app| 久久久午夜精品| 精品久久人人做人人爽综合| 94久久国产乱子伦精品免费| 天天久久狠狠色综合| 久久婷婷五月综合国产尤物app| 久久99中文字幕久久| 亚洲精品乱码久久久久久中文字幕| 国产精品九九久久免费视频| 国产福利电影一区二区三区久久久久成人精品综合 | 久久精品国产亚洲AV大全| 亚洲午夜精品久久久久久浪潮| 亚洲午夜福利精品久久| 久久青青草原精品国产不卡| 99久久这里只精品国产免费| 久久午夜夜伦鲁鲁片免费无码影视| 久久亚洲国产午夜精品理论片| 午夜精品久久久久久久| 久久亚洲精品无码aⅴ大香| 亚洲国产成人久久综合区| 亚洲国产成人乱码精品女人久久久不卡 | 精品久久久久国产免费| 国产精品久久久久久久久鸭| www久久久天天com| 午夜不卡888久久|