function softHeapSelect(a[1..n], k) if k = 1 then return minimum(a[1..n]) create(S) for i from 1 to n insert(S, a[i]) for i from 1 to n/3 x := findmin(S) delete(S, x) xIndex := partition(a, x) // Returns new index of pivot xif k < xIndex softHeapSelect(a[1..xIndex-1], k) else softHeapSelect(a[xIndex..n], k-xIndex+1)
Chazelle, Bernard (November 2000). "The soft heap: an approximate priority queue with optimal error rate" (PDF). J. ACM. 47 (6): 1012–1027. CiteSeerX10.1.1.5.9705 . doi:10.1145/355541.355554
มกราคม 08, 2022
ซอฟต, ในว, ทยาการคอมพ, วเตอร, โดย, soft, heap, เป, นต, วแปรในโครงสร, างข, อม, data, structure, heap, ายๆ, งม, คำส, งท, สามารถส, งงานได, ชน, อการล, วงคำส, งโดยการ, corrupting, ทำความเส, ยหาย, การเพ, มข, เป, นก, ญแจสำค, ญในค, าของจำนวนท, แน, นอนท, อย, ใน, heap, . inwithyakarkhxmphiwetxr ody Soft heap epntwaeprinokhrngsrangkhxmul Data structure heap ngay sungmikhasngthisamarthsngnganid 5 chnid nikhuxkarlulwngkhasngodykar corrupting thakhwamesiyhay karephimkhun epnkuyaecsakhyinkhakhxngcanwnthiaennxnthixyuin Heap odymikhasngthiihinkardaeninkardngni create S srangsoft heap S khunmaihm insert S x aethrksmachik x in soft heap S meld S S rwm 2 raykarthixyuin soft heaps epnxnediyw srangSoft Heap ihm aelathalaythngsxngthing xneka delete S x lbsmachik x cak soft heap S findmin S eriykkhunkha return smachikin Soft Heap S kbkhaKeysthielkthisudHeapxun echn heaps Fibonacci samarththakhasngidsaercmakthisudodyimmicaepntxngmi corrupting aetimsamarthihkhxbekhtewlakhngthibnkardaeninkarinkhasng lb delete thisakhyid primankhxng Corruptionsamarthkhwbkhumidodykareluxkpharamietxr e aetkartngkhatakwanicaepntxngmikarisewlamakkhundwyechnkn O log 1 e sahrbxtrakarphidphladkhxng e thaythisudxlkrxlithumcamilksnadngni function softHeapSelect a 1 n k if k 1 then return minimum a 1 n create S for i from 1 to n insert S a i for i from 1 to n 3 x findmin S delete S x xIndex partition a x Returns new index of pivot x if k lt xIndex softHeapSelect a 1 xIndex 1 k else softHeapSelect a xIndex n k xIndex 1 khatwaeprthwipthiichinkareriyngladbkhwamsakhy eriykwa Soft Heap okhrngsrangkhxmulcathuksnbsnunodykrabwnkarhlkdngni insert karaethrk delete karlb meld karrwm findmin hakhathinxythisud epnthinaaeplkicmakthimnmikhwamsamarthinkarexachnakhxbekhtkhxnglxkaluthumbnkhwamsbsxnkhxng Heap inaebbcalxngkarepriybethiybphunthan ephuxthithalayxupsrrkhkhxngthvsdini exnothrpikhxngokhrngsrangkhxmulcathukthaihldlngodykhabangkhainKeys sungmikarphsmladbkhxng n khasngkbkhakhxngkhwamphidphlad Error rate e camikhaxyurahwang 0 lt e 1 2 singthiepnkhxyunynkhuxinewlaid swnmak e n mncami keys cathukykkhunmaichngan karhklangkhwamsbsxnkhxngaetlakhasngnnepnthiaennxn ykewninkhasng Insert sungcaichewla O Log 1 e khrngSoft Heap cadithisudktxemuxmikhakhxng e xyuinaebbcalxngkarepriybethiybphunthan odyokhrngsrangkhxmulnncamiaekhPointer xyuxyangediyw immi Array idthicaichkhaelkhsmmutiinkarsrang Keys id aenwkhwamkhidhlkkhxng Soft Heap khuxkarekhluxnyayraykarkhamokhrngsrangkhxmulimichthilaraykaraetepnklum nnepnipxyangpkti inokhrngsrangkhxmulcamilksnakhlaykb Carpooling karrwmodysarknipinesnthangediywkn odyinyanphahnaediywkn Keys catxngkhunxyukbphlkhxngmn ephuxthicarksaladbokhrngsrangkhxmulkhxng Heap exaiw Soft Heap samarthichkarkhanwnidxyangaennxnhrux mikhamththan aelakhaepxresnsungsud mnmipraoychnmaksahrbkarpramankhakareriyngladbkhxmul Sorting aela ephuxkhanwnhakhathitathisudkhxngaephnphumitnimxikdwyxangxing aekikhChazelle Bernard November 2000 The soft heap an approximate priority queue with optimal error rate PDF J ACM 47 6 1012 1027 CiteSeerX10 1 1 5 9705 doi 10 1145 355541 355554 ekhathungcak https th wikipedia org w index php title sxfthip amp oldid 7605334, wikipedia, วิกิ หนังสือ, หนังสือ, ห้องสมุด,
