锘??xml version="1.0" encoding="utf-8" standalone="yes"?>久久婷婷国产综合精品,亚洲国产成人精品久久久国产成人一区二区三区综 ,麻豆精品久久久一区二区http://www.shnenglu.com/msopengl/category/15595.html緇嗗井鍐沖畾鎴愯觸zh-cnFri, 09 Sep 2011 14:22:17 GMTFri, 09 Sep 2011 14:22:17 GMT60紼嬪簭鍛橀』鐭ョ殑浜屽崄涓栫邯鏈浼熷ぇ10澶х畻娉?/title><link>http://www.shnenglu.com/msopengl/articles/141393.html</link><dc:creator>Skill</dc:creator><author>Skill</author><pubDate>Wed, 09 Mar 2011 01:07:00 GMT</pubDate><guid>http://www.shnenglu.com/msopengl/articles/141393.html</guid><wfw:comment>http://www.shnenglu.com/msopengl/comments/141393.html</wfw:comment><comments>http://www.shnenglu.com/msopengl/articles/141393.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/msopengl/comments/commentRss/141393.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/msopengl/services/trackbacks/141393.html</trackback:ping><description><![CDATA[ <div id="jogwhvo" class="con"> <ul> <li> <h1>紼嬪簭鍛橀』鐭ョ殑浜屽崄涓栫邯鏈浼熷ぇ10澶х畻娉?/h1> </li> <li id="pdnnoxa" class="msg"> <span> <a >http://developer.51cto.com</a> 聽2011-01-13 09:40 聽v_JULY_v 聽CSDN鍗氬 聽<a >鎴戣璇勮(<span id="pinglun_1">1</span>)</a></span> </li> </ul> </div> <div id="qrfiveu" class="sum"> <ul class="summary">綆楁硶鏄▼搴忓憳鐨勬牴鏈紝铏界劧涓嬮潰浠嬬粛鐨勫崄澶х畻娉曟湁鏁板鐨勬垚鍒嗭紝浣嗙‘瀹炴槸紼嬪簭鍛橀』鐭ョ殑10澶х畻娉曘?/ul> </div> <p>鍙戞槑鍗佸ぇ綆楁硶鐨勫叾涓嚑浣嶇畻娉曞ぇ甯?/p> <p style="padding-left: 30px;"> <img class="fit-image" alt="" src="http://images.51cto.com/files/uploadimg/20110113/0942360.jpg" width="498" height="242" /> </p> <p> <strong>涓銆?946 钂欑壒鍗℃礇鏂規(guī)硶</strong> </p> <p>[1946: John von Neumann, Stan Ulam, and Nick Metropolis, all at the Los Alamos Scientific Laboratory, cook up the Metropolis algorithm, also known as the Monte Carlo method.]</p> <p>1946騫達(dá)紝緹庡浗鎷夋柉闃胯帿鏂浗瀹跺疄楠屽鐨勪笁浣嶇瀛﹀John von Neumann,Stan Ulam 鍜?Nick Metropolis</p> <p>鍏卞悓鍙戞槑錛岃縐頒負(fù)钂欑壒鍗℃礇鏂規(guī)硶銆?/p> <p>瀹冪殑鍏蜂綋瀹氫箟鏄細(xì)</p> <p>鍦ㄥ箍鍦轟笂鐢諱竴涓竟闀夸竴綾崇殑姝ｆ柟褰紝鍦ㄦ鏂瑰艦鍐呴儴闅忔剰鐢ㄧ矇絎旂敾涓涓笉瑙勫垯鐨勫艦鐘訛紝</p> <p>鐜板湪瑕佽綆楄繖涓笉瑙勫垯鍥懼艦鐨勯潰縐紝鎬庝箞璁＄畻鍒?</p> <p>钂欑壒鍗℃礇(Monte Carlo)鏂規(guī)硶鍛婅瘔鎴戜滑錛屽潎鍖鐨勫悜璇ユ鏂瑰艦鍐呮拻N錛圢 鏄竴涓緢澶х殑鑷劧鏁幫級(jí)涓粍璞嗭紝闅忓悗鏁版暟鏈夊灝戜釜榛勮眴鍦ㄨ繖涓笉瑙勫垯鍑犱綍褰㈢姸鍐呴儴錛屾瘮濡傝鏈塎涓紝<br /> 閭ｄ箞錛岃繖涓鎬艦鐘剁殑闈㈢Н渚胯繎浼間簬M/N錛孨瓚婂ぇ錛岀畻鍑烘潵鐨勫間究瓚婄簿紜傚湪榪欓噷鎴戜滑瑕佸亣瀹氳眴瀛愰兘鍦ㄤ竴涓鉤闈笂錛岀浉浜掍箣闂存病鏈夐噸鍙犮?/p> <p>钂欑壒鍗℃礇鏂規(guī)硶鍙敤浜庤繎浼艱綆楀渾鍛ㄧ巼錛氳璁＄畻鏈烘瘡嬈￠殢鏈虹敓鎴愪袱涓?鍒?涔嬮棿鐨勬暟錛岀湅榪欎袱涓疄鏁版槸鍚﹀湪鍗曚綅鍦嗗唴銆傜敓鎴愪竴緋誨垪闅忔満鐐癸紝緇熻鍗曚綅鍦嗗唴鐨勭偣鏁? 涓庢葷偣鏁幫紝錛堝渾闈㈢Н鍜屾鏂瑰艦闈㈢Н涔嬫瘮涓篜I:1錛孭I涓哄渾鍛ㄧ巼錛夛紝褰撻殢鏈虹偣鍙栧緱瓚婂錛堜絾鍗充嬌鍙?0鐨?嬈℃柟涓殢鏈虹偣鏃訛紝鍏剁粨鏋滀篃浠呭湪鍓?浣嶄笌鍦嗗懆鐜囧惢鍚堬級(jí) 鏃訛紝鍏剁粨鏋滆秺鎺ヨ繎浜庡渾鍛ㄧ巼銆?/p> <p> <strong>浜屻?947 鍗曠函褰㈡硶</strong> </p> <p>[1947: George Dantzig, at the RAND Corporation, creates the simplex method for linear programming.]</p> <p>1947騫達(dá)紝鍏板痙鍏徃鐨勶紝Grorge Dantzig錛屽彂鏄庝簡(jiǎn)鍗曠函褰㈡柟娉曘傚崟綰艦娉曪紝姝ゅ悗鎴愪負(fù)浜?jiǎn)绾挎ц鍒掑縐戠殑閲嶈鍩虹煶銆傛墍璋撶嚎鎬ц鍒掞紝綆鍗曠殑璇達(dá)紝灝辨槸緇欏畾涓緇勭嚎鎬э紙鎵鏈夊彉閲忛兘鏄竴嬈″箓錛夌害鏉? 鏉′歡錛堜緥濡俛1*x1+b1*x2+c1*x3>0)錛屾眰涓涓粰瀹氱殑鐩爣鍑芥暟鐨勬瀬鍊箋?/p> <p>榪欎箞璇翠技涔庝篃澶お澶娊璞′簡(jiǎn)錛屼絾鍦ㄧ幇瀹炰腑鑳芥淳涓婄敤鍦虹殑渚嬪瓙鍙笉緗曡鈥斺旀瘮濡傚浜庝竴涓叕鍙歌岃█錛屽叾鑳藉鎶曞叆鐢熶駭鐨勪漢鍔涚墿鍔涙湁闄愶紙鈥滅嚎鎬х害鏉熸潯浠垛濓級(jí)錛岃? 鍏徃鐨勭洰鏍囨槸鍒╂鼎鏈澶у寲錛堚滅洰鏍囧嚱鏁板彇鏈澶у尖濓級(jí)錛岀湅錛岀嚎鎬ц鍒掑茍涓嶆娊璞″惂錛佺嚎鎬ц鍒掍綔涓鴻繍絳瑰(operation research)鐨勪竴閮ㄥ垎錛屾垚涓虹鐞嗙瀛﹂鍩熺殑涓縐嶉噸瑕佸伐鍏楓傝孌antzig鎻愬嚭鐨勫崟綰艦娉曚究鏄眰瑙ｇ被浼肩嚎鎬ц鍒掗棶棰樼殑涓涓瀬鍏舵湁鏁堢殑鏂規(guī)硶銆?/p> <p> <strong>涓夈?950 Krylov瀛愮┖闂磋凱浠ｆ硶</strong> </p> <p>[1950: Magnus Hestenes, Eduard Stiefel, and Cornelius Lanczos, all from the Institute for Numerical Analysis at the National Bureau of Standards, initiate the development of Krylov subspace iteration methods.]</p> <p>1950騫達(dá)細(xì)緹庡浗鍥藉鏍囧噯灞鏁板煎垎鏋愮爺絀舵墍鐨勶紝椹牸鍔柉Hestenes錛岀埍寰峰崕鏂借拏璐瑰皵鍜岀灝煎埄鍘勬柉鐨凩anczos錛屽彂鏄庝簡(jiǎn)Krylov瀛愮┖闂? 榪唬娉曘侹rylov瀛愮┖闂磋凱浠ｆ硶鏄敤鏉ユ眰瑙ｅ艦濡侫x=b 鐨勬柟紼嬶紝A鏄竴涓猲*n 鐨勭煩闃碉紝褰搉鍏呭垎澶ф椂錛岀洿鎺ヨ綆楀彉寰楅潪甯稿洶闅撅紝鑰孠rylov鏂規(guī)硶鍒欏閥濡欏湴灝嗗叾鍙樹負(fù)Kxi+1=Kxi+b-Axi鐨勮凱浠ｅ艦寮忔潵姹傝В銆傝繖閲岀殑K(鏉ユ簮浜庝綔 鑰呬縿鍥戒漢Nikolai Krylov濮撴皬鐨勯瀛楁瘝)鏄竴涓瀯閫犲嚭鏉ョ殑鎺ヨ繎浜嶢鐨勭煩闃碉紝鑰岃凱浠ｅ艦寮忕殑綆楁硶鐨勫澶勫湪浜庯紝瀹冨皢澶嶆潅闂鍖栫畝涓洪樁孌墊х殑鏄撲簬璁＄畻鐨勫瓙姝ラ銆?/p> <p> <strong>鍥涖?951 鐭╅樀璁＄畻鐨勫垎瑙ｆ柟娉?/strong> </p> <p>[1951: Alston Householder of Oak Ridge National Laboratory formalizes the decompositional approach to matrix computations.]</p> <p>1951騫達(dá)紝闃垮皵鏂氭鏍?wèi)宀浗瀹跺疄楠屽鐨凙lston Householder鎻愬嚭錛岀煩闃佃綆楃殑鍒嗚В鏂規(guī)硶銆傝繖涓畻娉曡瘉鏄庝簡(jiǎn)浠諱綍鐭╅樀閮藉彲浠ュ垎瑙ｄ負(fù)涓夎銆佸瑙掋佹浜ゅ拰鍏朵粬鐗規(guī)畩褰㈠紡鐨勭煩闃碉紝璇ョ畻娉曠殑鎰忎箟浣垮緱寮鍙戠伒媧葷殑鐭╅樀璁＄畻杞歡鍖呮垚涓哄彲鑳姐?/p> <p> <strong>浜斻?957 浼樺寲鐨凢ortran緙栬瘧鍣?/strong> </p> <p>[1957: John Backus leads a team at IBM in developing the Fortran optimizing compiler.]</p> <p>1957騫達(dá)細(xì)綰︾堪宸村簱鏂瀵煎紑鍙戠殑IBM鐨勫洟闃燂紝鍒涢犱簡(jiǎn)Fortran浼樺寲緙栬瘧鍣ㄣ侳ortran錛屼害璇戜負(fù)紱忎紶錛屾槸鐢盕ormula Translation涓や釜瀛楁墍緇勫悎鑰屾垚錛屾剰鎬濇槸鈥滃叕寮忕炕璇戔濄傚畠鏄笘鐣屼笂絎竴涓姝ｅ紡閲囩敤騫舵祦浼犺嚦浠婄殑楂樼駭緙栫▼璇█銆傝繖涓璦鐜板湪錛屽凡緇忓彂灞曞埌 浜?jiǎn)锛孎ortran 2008錛屽茍涓轟漢浠墍鐔熺煡銆?/p> <p> <strong>鍏?959-61 璁＄畻鐭╅樀鐗瑰緛鍊肩殑QR綆楁硶</strong> </p> <p>[1959鈥?1: J.G.F. Francis of Ferranti Ltd, London, finds a stable method for computing eigenvalues, known as the QR algorithm.]</p> <p>1959-61錛氫雞鏁﹁垂浼﹁拏鏈夐檺鍏徃鐨凧.G.F. Francis錛屾壘鍒頒簡(jiǎn)涓縐嶇ǔ瀹氱殑鐗瑰緛鍊肩殑璁＄畻鏂規(guī)硶錛岃繖灝辨槸钁楀悕鐨凲R綆楁硶銆傝繖涔熸槸涓涓拰綰挎т唬鏁版湁鍏崇殑綆楁硶錛屽榪囩嚎鎬т唬鏁扮殑搴旇璁板緱鈥滅煩闃電殑鐗瑰緛鍊尖濓紝 璁＄畻鐗瑰緛鍊兼槸鐭╅樀璁＄畻鐨勬渶鏍稿績(jī)鍐呭涔嬩竴錛屼紶緇熺殑姹傝В鏂規(guī)娑夊強(qiáng)鍒伴珮?gòu)啤鏂菇E嬫眰鏍癸紝褰撻棶棰樿妯″ぇ鐨勬椂鍊欏崄鍒嗗洶闅俱俀R綆楁硶鎶婄煩闃靛垎瑙ｆ垚涓涓浜ょ煩闃?甯屾湜璇繪鏂? 鐨勪綘錛岀煡閬撲粈涔堟槸姝ｄ氦鐭╅樀銆?D銆?涓庝竴涓笂涓夎鐭╅樀鐨勭Н錛屽拰鍓嶉潰鎻愬埌鐨凨rylov 鏂規(guī)硶綾諱技錛岃繖鍙堟槸涓涓凱浠ｇ畻娉曪紝瀹冩妸澶嶆潅鐨勯珮?gòu)啤鏂菇E嬫眰鏍歸棶棰樺寲綆涓洪樁孌墊х殑鏄撲簬璁＄畻鐨勫瓙姝ラ錛屼嬌寰楃敤璁＄畻鏈烘眰瑙ｅぇ瑙勬ā鐭╅樀鐗瑰緛鍊兼垚涓哄彲鑳姐傝繖涓畻娉曠殑浣滆? 鏄潵鑷嫳鍥戒雞鏁︾殑J.G.F. Francis銆?/p> <p> <strong>涓冦?962 蹇熸帓搴忕畻娉?/strong> </p> <p>[1962: Tony Hoare of Elliott Brothers, Ltd., London, presents Quicksort.]</p> <p>1962騫達(dá)細(xì)浼︽暒鐨勶紝鎵樺凹鍩冨埄濂ョ壒鍏勫紵鏈夐檺鍏徃錛岄湇灝?dāng)鎻愬囖Z簡(jiǎn)蹇熸帓搴忋傚搱鍝堬紝鎭枩浣狅紝緇堜簬鐪嬪埌浜?jiǎn)鍙兘鏄綘绗竴涓瘮杈冪啛鎮(zhèn)夌殑綆楁硶~銆傚揩閫熸帓搴忕畻娉曚綔涓? 鎺掑簭綆楁硶涓殑緇忓吀綆楁硶錛屽畠琚簲鐢ㄧ殑褰卞瓙闅忓鍙銆傚揩閫熸帓搴忕畻娉曟渶鏃╃敱Tony Hoare鐖靛＋璁捐錛屽畠鐨勫熀鏈濇兂鏄皢寰呮帓搴忓垪鍒嗕負(fù)涓ゅ崐錛屽乏杈圭殑涓鍗婃繪槸鈥滃皬鐨勨濓紝鍙寵竟鐨勪竴鍗婃繪槸鈥滃ぇ鐨勨濓紝榪欎竴榪囩▼涓嶆柇閫掑綊鎸佺畫涓嬪幓錛岀洿鍒版暣涓簭鍒楁湁 搴忋傝璧瘋繖浣峊ony Hoare鐖靛＋錛屽揩閫熸帓搴忕畻娉曞叾瀹炲彧鏄粬涓嶇粡鎰忛棿鐨勫皬灝忓彂鐜拌屽凡錛屼粬瀵逛簬璁＄畻鏈鴻礎(chǔ)鐚富瑕佸寘鎷艦寮忓寲鏂規(guī)硶鐞嗚錛屼互鍙?qiáng)ALGOL60 緙栫▼璇█鐨勫彂鏄庣瓑錛屼粬涔熷洜榪欎簺鎴愬氨鑾峰緱1980 騫村浘鐏靛銆?/p> <p>========</p> <p>鍏充簬蹇熸帓搴忕畻娉曠殑鍏蜂綋璁よ瘑涓庡簲鐢紝鍙弬鑰冩垜鍐欑殑涓綃囨枃绔狅紝</p> <p>綺鵑氬叓澶ф帓搴忕畻娉曠郴鍒椼佷竴銆佸揩閫熸帓搴忕畻娉曪細(xì)</p> <p>http://blog.csdn.net/v_JULY_v/archive/2011/01/04/6116297.aspx</p> <p>------------------------------------------------------------</p> <p>蹇熸帓搴忕殑騫沖潎鏃墮棿澶嶆潅搴︿粎浠呬負(fù)O(Nlog(N))錛岀浉姣斾簬鏅氶夋嫨鎺掑簭鍜屽啋娉℃帓搴忕瓑鑰岃█錛?/p> <p>瀹炲湪鏄巻鍙叉х殑鍒涗婦銆?/p> <p> <strong>鍏?965 蹇熷倕绔嬪彾鍙樻崲</strong> </p> <p>[1965: James Cooley of the IBM T.J. Watson Research Center and John Tukey of Princeton University and AT&T Bell Laboratories unveil the fast Fourier transform.]</p> <p>1965騫達(dá)細(xì)IBM 鍗庣敓鐮旂┒闄㈢殑James Cooley錛屽拰鏅灄鏂】澶у鐨凧ohn Tukey錛孉T錛員璐濆皵瀹為獙瀹ゅ叡鍚屾帹鍑轟簡(jiǎn)蹇熷倕绔嬪彾鍙樻崲銆傚揩閫熷倕绔嬪彾綆楁硶鏄鏁ｅ倕绔嬪彾綆楁硶錛堣繖鍙槸鏁板瓧淇″彿澶勭悊鐨勫熀鐭籌級(jí)鐨勪竴縐嶅揩閫熺畻娉曪紝鍏舵椂闂村鏉傚害浠? 涓篛(Nlog(N))錛涙瘮鏃墮棿鏁堢巼鏇翠負(fù)閲嶈鐨勬槸錛屽揩閫熷倕绔嬪彾綆楁硶闈炲父瀹規(guī)槗鐢ㄧ‖浠跺疄鐜幫紝鍥犳瀹冨湪鐢?shù)瀛愭妧鏈鍩熷緱鍒版瀬鍏跺箍娉涚殑搴旂敤銆傛棩鍚庯紝鎴戜細(xì)鍦ㄦ垜鐨勭粡鍏哥畻 娉曠爺絀剁郴鍒楋紝鐫閲嶉槓榪版綆楁硶銆?/p> <p> <strong>涔?jié)銆?977 鏁存暟鍏崇郴鎺㈡祴綆楁硶</strong> </p> <p>[1977: Helaman Ferguson and Rodney Forcade of Brigham Young University advance an integerrelation detection algorithm.]</p> <p>1977騫達(dá)細(xì)Helaman Ferguson鍜?浼槑緲板ぇ瀛︾殑Rodney Forcade錛屾彁鍑轟簡(jiǎn)Forcade媯(gè)嫻嬬畻娉曠殑鏁存暟鍏崇郴銆傛暣鏁板叧緋繪帰嫻嬫槸涓彜鑰佺殑闂錛屽叾鍘嗗彶鐢氳嚦鍙互榪芥函鍒版鍑犻噷寰風(fēng)殑鏃朵唬銆傚叿浣撶殑璇?緇欏畾鈥旂粍瀹炴暟 X1,X2,...,Xn錛屾槸鍚﹀瓨鍦ㄤ笉鍏ㄤ負(fù)闆剁殑鏁存暟a1,a2,...an錛屼嬌寰?a1 x 1 +a2 x2 + . . . + an x n 錛??</p> <p>榪欎竴騫碆righamYoung澶у鐨凥elaman Ferguson 鍜孯odney Forcade瑙ｅ喅浜?jiǎn)杩欎竴闂銆傝綆楁硶搴旂敤浜庘滅畝鍖栭噺瀛愬満璁轟腑鐨凢eynman鍥劇殑璁＄畻鈥濄俹k錛屽畠騫朵笉瑕佷綘鎳傦紝浜?jiǎn)瑙ｅ崨_彲銆?/p> <p> <strong>鍗併?987 蹇熷鏋佺畻娉?/strong> </p> <p>[1987: Leslie Greengard and Vladimir Rokhlin of Yale University invent the fast multipolealgorithm.]</p> <p>1987騫達(dá)細(xì)鑾辨柉鍒╃殑Greengard錛屽拰鑰墮瞾澶у鐨凴okhlin鍙戞槑浜?jiǎn)蹇熷鏋佺畻娉曘?/p> <p>姝ゅ揩閫熷鏋佺畻娉曠敤鏉ヨ綆椻滅粡鐢卞紩鍔涙垨闈?rùn)鐢?shù)鍔涚浉浜掍綔鐢ㄧ殑N 涓矑瀛愯繍鍔ㄧ殑綺劇‘璁＄畻鈥斺斾緥濡傞摱娌崇郴涓殑鏄熶綋錛屾垨鑰呰泲鐧借川涓殑鍘熷瓙闂寸殑鐩鎬簰浣滅敤鈥濄俹k錛屼簡(jiǎn)瑙ｅ嵆鍙偮?/p> <p>鏈枃鏉ヨ嚜CSDN鍗氬錛岃漿杞借鏍囨槑鍑哄錛歨ttp://blog.csdn.net/v_JULY_v/archive/2011/01/10/6127953.aspx</p> <img src ="http://www.shnenglu.com/msopengl/aggbug/141393.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/msopengl/" target="_blank">Skill</a> 2011-03-09 09:07 <a href="http://www.shnenglu.com/msopengl/articles/141393.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>浜屽弶鏍?wèi)鐨勫疄鐜?/title><link>http://www.shnenglu.com/msopengl/articles/135563.html</link><dc:creator>Skill</dc:creator><author>Skill</author><pubDate>Mon, 06 Dec 2010 03:03:00 GMT</pubDate><guid>http://www.shnenglu.com/msopengl/articles/135563.html</guid><wfw:comment>http://www.shnenglu.com/msopengl/comments/135563.html</wfw:comment><comments>http://www.shnenglu.com/msopengl/articles/135563.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/msopengl/comments/commentRss/135563.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/msopengl/services/trackbacks/135563.html</trackback:ping><description><![CDATA[<pre>//浜屽弶鏍?wèi)鐨勫缓绔嬨佸瓨鍌ㄤ笌閬嶅巻<br>#include <iostream.h><br>struct BintrNode<br>{<br> char value;<br> BintrNode* lf;<br> BintrNode* rt;<br>};<br><br> void init(BintrNode* &p)<br>{<br> char ch;<br> cin>>ch;<br> if(ch!='!')<br> {<br> p=new BintrNode;<br> p->value=ch;<br> init(p->lf);<br> init(p->rt);<br> }<br> else <br> {<br> p=NULL;<br> }<br>}<br> void pre(BintrNode* p)<br> {<br> if(p)<br> {<br> cout<<p->value;<br> pre(p->lf);<br> pre(p->rt);<br> }<br> }<br> void ino(BintrNode* p)<br> {<br> if(p)<br> {<br> ino(p->lf);<br> cout<<p->value;<br> ino(p->rt);<br> }<br> }<br> void pro(BintrNode* p)<br> {<br> if(p)<br> {<br> pro(p->lf);<br> pro(p->rt);<br> cout<<p->value;<br> }<br> }<br> void main()<br> {<br>BintrNode* bt;<br>init(bt);<br>pre(bt);<br>cout<<endl;<br>ino(bt);<br>cout<<endl;<br>pro(bt);<br>cout<<endl;<br><br> }<br><br> <pre>#include<stdio.h><br>#include<stdlib.h><br>struct node<br>{<br> int data;<br> struct node *lh,*rh;<br> int ltag,rtag;<br>}*pr,*t,*s[30];<br><br>struct node* creat()<br>{<br> struct node *t,*q;<br> int i,x,j;<br> printf("i,x=");<br> scanf("%d%d",&i,&x);<br> while((i!=0)&&(x!=0))<br> {<br> q=(struct node *)malloc(sizeof(struct node));<br> q->data=x;<br> q->lh=NULL;<br> q->rh=NULL;<br> s[i ]=q;<br> if(i==1)<br> t=q;<br> else<br> {<br> j=i/2;<br> if((i%2)==0)<br> s[j]->lh=q;<br> else<br> s[j]->rh=q;<br> }<br> printf("i,x=");<br> scanf("%d%d",&i,&x);<br> }<br> return(t);<br>}<br><br>/*void inthread(struct node *p) //閫掑綊綆楁硶<br>{<br> if(p!=NULL)<br> {<br> inthread(p->lh);<br> printf("%6d\t",p->data);<br> if(p->lh!=NULL)<br> p->ltag=0;<br> else<br> {<br> p->ltag=1;<br> p->lh=pr;<br> } //寤虹珛P鑺傜偣鐨勫乏綰跨儲(chǔ)錛屾寚鍚戝墠瓚嬭妭鐐筆R<br> if(pr!=NULL)<br> {<br> if(pr->rh!=NULL)<br> pr->rtag=0;<br> else<br> {<br> pr->rtag=1;<br> pr->rh=p;<br> }//鍓嶈秼鑺傜偣PR寤虹珛宸︾嚎绱紝鎸囧悜鑺傜偣P<br> }<br> pr=p;//pr璺熶笂p,浠ヤ究p鍚戝悗縐誨姩<br> inthread(p->rh);<br> }<br>}*/<br><br>void inthread(struct node *t)//闈為掑綊綆楁硶<br>{<br> int top,bools;<br> struct node *p;<br> pr=NULL;p=t;top=0;bools=1;<br> do{<br> while(p!=NULL)<br> {<br> top++;<br> s[top]=p;<br> p=p->lh;<br> }<br> if(top==0)bools=0;<br> else<br> {<br> p=s[top];<br> top--;<br> printf("%6d",p->data);<br> if(p->lh!=NULL)<br> p->ltag=0;<br> else<br> {<br> p->ltag=1;<br> p->lh=pr;<br> } //寤虹珛P鑺傜偣鐨勫乏綰跨儲(chǔ)錛屾寚鍚戝墠瓚嬭妭鐐筆R<br> if(pr!=NULL)<br> {<br> if(pr->rh!=NULL)<br> pr->rtag=0;<br> else<br> {<br> pr->rtag=1;<br> pr->rh=p;<br> }//鍓嶈秼鑺傜偣PR寤虹珛宸︾嚎绱紝鎸囧悜鑺傜偣P<br> }<br> pr=p;//pr璺熶笂p,浠ヤ究p鍚戝悗縐誨姩<br> p=p->rh;<br> }//END else<br> }while(bools);<br> pr->rh=NULL;<br>}<br><br>main()<br>{<br> pr=NULL;<br> t=creat();<br> inthread(t);<br> pr->rh=NULL;<br>}<br><br> <pre>#include<stdio.h><br>#include<malloc.h><br>#include<iostream><br><br>//瀹氫箟鑺傜偣 <br>typedef struct BiNode{<br> char data;<br> struct BiNode *lch;<br> struct BiNode *rch;<br>}BiNode,*BiTree;<br><br>//鍏堝簭鎷撳睍搴忓垪寤虹珛浜屽弶鏍?<br>void Create(BiTree &T)<br>{<br> T =(BiNode*) malloc (sizeof(BiNode));<br> <br> printf("Enter the data \n");<br> scanf(" %c",&T->data);<br> if(T->data=='#') T = NULL;<br> if(T){<br> printf("");<br> Create(T->lch);<br> Create(T->rch);<br> }<br>}<br><br>//鍏堝簭閬嶅巻 (閫掑綊)<br>void Preorder (BiTree T)<br>{ <br> if (T) {<br> printf(" %c",T->data); // 璁塊棶鏍圭粨鐐?br> <br> Preorder(T->lch); // 閬嶅巻宸﹀瓙鏍?br> Preorder(T->rch);// 閬嶅巻鍙沖瓙鏍?br> }<br>}<br><br>//涓簭閬嶅巻 錛堥掑綊錛?br>void Inorder (BiTree T)<br>{<br> if(T) {<br> Inorder(T->lch);<br> <br> printf(" %c",T->data);<br> <br> Inorder(T->rch); <br> }<br>} <br><br>//鍚庡簭閬嶅巻 錛堥掑綊錛?br>void Postorder (BiTree T)<br>{<br> if(T) {<br> Postorder(T->lch);<br> Postorder(T->rch);<br> <br> printf(" %c",T->data); <br> }<br>} <br><br>int main()<br>{<br> //寤烘爲(wèi) <br> printf("The fuction Create() is called.\n");<br> BiTree T;<br> Create(T);<br> <br> //涓夌閬嶅巻閫掑綊綆楁硶 <br> printf("\n"); <br> printf("The fuction Preorder() is called.\n");<br> Preorder(T);<br> <br> printf("\n");<br> printf("The fuction Inorder() is called.\n");<br> Inorder(T);<br> <br> printf("\n");<br> printf("The fuction Postorder() is called.\n");<br> Postorder(T);<br> <br> <br> printf("\n");<br> system("pause");<br> <br>}<br></pre> <br></pre> <br><br></pre> <br><img src ="http://www.shnenglu.com/msopengl/aggbug/135563.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/msopengl/" target="_blank">Skill</a> 2010-12-06 11:03 <a href="http://www.shnenglu.com/msopengl/articles/135563.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item></channel></rss> <footer> <div class="friendship-link"> <p>感谢您访问我们的网站，您可能还对以下资源感兴趣：</p> <a href="http://www.shnenglu.com/" title="精品视频久久久久">精品视频久久久久</a> <div class="friend-links"> </div> </div> </footer> <a href="http://www.abovefq.cn" target="_blank">久久精品国产精品亚洲人人</a>| <a href="http://www.ksxhsd.cn" target="_blank">伊人精品久久久久7777</a>| <a href="http://www.tnbzjrzhl.cn" target="_blank">国产欧美久久久精品</a>| <a href="http://www.fddyc.cn" target="_blank">日韩中文久久</a>| <a href="http://www.aqbfrmi.cn" target="_blank">一级做a爰片久久毛片人呢</a>| <a href="http://www.0751seo.cn" target="_blank">国内精品久久久久久中文字幕 </a>| <a href="http://www.hvgt.cn" target="_blank">久久精品男人影院</a>| <a href="http://www.21tjsports.cn" target="_blank">精品国产乱码久久久久久浪潮</a>| <a href="http://www.qq577.cn" target="_blank">漂亮人妻被中出中文字幕久久 </a>| <a href="http://www.damangdao.cn" target="_blank">久久国产精品成人影院</a>| <a href="http://www.fz-tm.cn" target="_blank">久久国产高清一区二区三区</a>| <a href="http://www.asook.cn" target="_blank">亚洲国产欧美国产综合久久</a>| <a href="http://www.ouseshi.cn" target="_blank">精品久久国产一区二区三区香蕉 </a>| <a href="http://www.jumeiba.cn" target="_blank">久久亚洲精品无码AV红樱桃</a>| <a href="http://www.schooldvd.cn" target="_blank">26uuu久久五月天</a>| <a href="http://www.pvzj.cn" target="_blank">亚洲AV无码久久</a>| <a href="http://www.watchesmade.cn" target="_blank">久久久精品人妻无码专区不卡 </a>| <a href="http://www.zhoushandk.cn" target="_blank">亚洲婷婷国产精品电影人久久</a>| <a href="http://www.omsai.cn" target="_blank">成人国内精品久久久久一区</a>| <a href="http://www.tb901.cn" target="_blank">思思久久99热只有频精品66</a>| <a href="http://www.cfgcurn.cn" target="_blank">亚洲国产精品久久久久久</a>| <a href="http://www.qinyoyo.cn" target="_blank">无码人妻久久一区二区三区免费丨</a>| <a href="http://www.laopaiwaihui.cn" target="_blank">99久久亚洲综合精品网站</a>| <a href="http://www.fti1st.com.cn" target="_blank">亚洲欧美伊人久久综合一区二区</a>| <a href="http://www.shanghuangzb.cn" target="_blank">国产精品xxxx国产喷水亚洲国产精品无码久久一区 </a>| <a href="http://www.qzlhscqt.cn" target="_blank">久久99精品久久久久久</a>| <a href="http://www.mir802.cn" target="_blank">无码精品久久久天天影视</a>| <a href="http://www.s9375.cn" target="_blank">久久乐国产综合亚洲精品</a>| <a href="http://www.fanggumen.cn" target="_blank">国内精品久久久久久久coent </a>| <a href="http://www.cqhxdj.com.cn" target="_blank">久久无码中文字幕东京热</a>| <a href="http://www.djlf.net.cn" target="_blank">久久精品国产亚洲7777</a>| <a href="http://www.qancen.cn" target="_blank">91精品国产色综久久</a>| <a href="http://www.wwmw.com.cn" target="_blank">AV无码久久久久不卡蜜桃</a>| <a href="http://www.itsidekick.cn" target="_blank">人妻少妇久久中文字幕</a>| <a href="http://www.mdjzyz.cn" target="_blank">久久久久亚洲精品男人的天堂</a>| <a href="http://www.yutobe.cn" target="_blank">亚洲国产成人久久综合一</a>| <a href="http://www.iysb.cn" target="_blank">久久婷婷综合中文字幕</a>| <a href="http://www.591happy.cn" target="_blank">久久免费视频网站</a>| <a href="http://www.vcfh.cn" target="_blank">欧美久久精品一级c片片</a>| <a href="http://www.enld.cn" target="_blank">99久久99久久精品国产</a>| <a href="http://www.woaisheying.cn" target="_blank">97超级碰碰碰碰久久久久</a>| <script> (function(){ var bp = document.createElement('script'); var curProtocol = window.location.protocol.split(':')[0]; if (curProtocol === 'https') { bp.src = 'https://zz.bdstatic.com/linksubmit/push.js'; } else { bp.src = 'http://push.zhanzhang.baidu.com/push.js'; } var s = document.getElementsByTagName("script")[0]; s.parentNode.insertBefore(bp, s); })(); </script> </body>