Knuth, Donald (1998). "Section 5.2.4: Sorting by Merging". Sorting and Searching. The Art of Computer Programming. 3 (2nd ed.). Addison-Wesley. pp. 158–168. ISBN0-201-89685-0.CS1 maint: ref=harv (link)
สิงหาคม 16, 2021
การเร, ยงลำด, บแบบผสาน, ในสาขาว, ทยาการคอมพ, วเตอร, งกฤษ, merge, sort, เป, นข, นตอนว, ในการเร, ยงลำด, บท, อาศ, ยการเปร, ยบเท, ยบ, และย, งเป, นต, วอย, างข, นตอนว, ใช, หล, กการแบ, งแยกและเอาชนะทำให, นตอนว, ประส, ทธ, ภาพ, ในการอ, มพล, เมนต, เพ, อการใช, งานจร, นสา. insakhawithyakarkhxmphiwetxr kareriyngladbaebbphsan xngkvs Merge Sort epnkhntxnwithiinkareriyngladbthixasykarepriybethiyb aelayngepntwxyangkhntxnwithithiichhlkkaraebngaeykaelaexachnathaihkhntxnwithinimiprasiththiphaph O n log n inkarximphliemntephuxkarichngancring nnsamarththaidthngaebbbnlnglang Top down aelaaebblangkhunbn Bottom up xnunginkarximphliemntodythwipaelwkareriyngaebbnicaimsunyesiyladbkhxngkhxmulthimikhaethakn nnkhuxepnkareriyngthiesthiyr kareriyngladbaebbphsan thukesnxkhunkhrngaerkodycxhn fxn nxymnninpi kh s 1945 1 kareriyngladbaebbphsanphaphtwxyangkareriyngladbaebbphsan ermdwykaraebngkhxmulxxkepnswnthielkthisud aelwermphsankhxmulkxnelk ekhadwyknklayepnkhxmulkxnthiihykhun inthisudkhxmulthukchincaeriyngladbxyangsmburnpraephthkhntxnwithikareriyngladbokhrngsrangkhxmulaethwladb Array prasiththiphaphemuxekidkrniaeythisudO n log n prasiththiphaphemuxekidkrnidithisudO n log n odythwip O n emuxisenguxnikhphiessprasiththiphaphemuxekidkrnithwipO n log n primankhwamtxngkarphunthiemuxekidkrniaeythisudO n rwmthngaethwladbthichwyinkareriyngxikethatwdkhk enuxha 1 khntxnwithi 2 echingwiekhraah 3 xangxing 4 brrnanukrmkhntxnwithi aekikhkhntxnwithixasyhlkkaraebngaeykaelaexachnaaelakarewiynbngekid odymiraylaexiyddngni khntxnkaraebng smmtiwamikhxmulxyu n chud thamikhxmulaekh 1 chud nnkhuxkhxmulnneriyngladbaelw thamikhxmulmakkwann ihaebngepnsxngswn aelwthakarewiynbngekid khntxnexachna emuxthungkhntxnnicaidkhxmulsxngswn odythiaetlaswneriynginswnkhxngtwexngeriybrxyaelw thakarrwmkhxmulthngsxngswnnnihepnkhxmulkxnediywthithngkxnnneriyngladbaelwtwxyangkarximphliemntdwyrhsethiym thakareriyngladbdwykaroynlistkhxmulipthifngkchn MergeSort phllphththixxkcakfngkchnnnkhuxkhxmulthieriyngladbaelw MergeSort array Assss if A size 0 return A mid A size 2 AA MergeSort A 0 mid BB MergeSort A mid A size return MergeSort Merge AA BB MergeSort Merge array A array B C new array aa 0 bb 0 while aa lt A size and bb lt B size if A aa lt B bb C A aa else if A aa gt B bb C B bb else aa 1 bb 1 while aa lt A size C A aa while bb lt B size C B bb return C echingwiekhraah aekikh phaphaesdngkareriyngladbaethwladb 7 twdwywithikarphsan aebbbnlnglang inkareriyngladbkhxmulthngsin n chud kareriyngladbaebbphsan miprasiththiphaphinkrnidithisud odymiidisenguxnikhphiess krniechliy aelakrniaeysud ethaknkhux O n log n odycaaesdngihdudngni smmtiihewlathiichinkareriyngkhxmul n chud aethndwy T n enuxngcak kareriyngladbaebbphsan misxngkhntxnodykhnaerkkhuxkaraebngepnsxngswnsungsamarththaidinewlakhngthiaetcatxngewiyngbngekideriyktwexnglngipaekpyhathielklngkhrunghnungsxngpyha caidwainswnaerkichewla 2T n 2 aelakhnthisxngsungepnkarphsankhxmulsxngchudthielkkwa thieriyngintwexngaelw epnkhxmulchudihycaichewlaxik n dngthiidaesdngihduintwxyangkarximphliemntdanbn emuxrwmthngsxngkhnaelwcaichewlathngsin T n 2T n 2 n hakich Master Theorem inkarwiekhraahsmkarnicaidphllphththepn O n log n dngthiidklawiwxangxing aekikh Knuth 1998 p 158 brrnanukrm aekikhKnuth Donald 1998 Section 5 2 4 Sorting by Merging Sorting and Searching The Art of Computer Programming 3 2nd ed Addison Wesley pp 158 168 ISBN 0 201 89685 0 CS1 maint ref harv link ekhathungcak https th wikipedia org w index php title kareriyngladbaebbphsan amp oldid 9106913, wikipedia, วิกิ หนังสือ, หนังสือ, ห้องสมุด,