(±¸)Á¤º¸°úÇÐȸ ³í¹®Áö
Current Result Document : 4 / 5
ÇѱÛÁ¦¸ñ(Korean Title) |
HeapÀ» º´ÇÕ½ÃÅ°±â À§ÇÑ ºü¸¥ ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
A Fast Algorithm for Merging Heaps |
ÀúÀÚ(Author) |
±è°æÅÂ
¹Î¿ë½Ä
Kyung Tae Kim
Yong Sik Min
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 14 NO. 04 PP. 0270 ~ 0276 (1987. 11) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®Àº Å©±â°¡ nÀÎ nheap°ú Å©±â°¡ kÀÎ kheapÀ» º´ÇÕÇÏ¿© »õ·Î¿î heapÀ» ±¸¼º½ÃÅ°±â À§ÇÑ ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÏ¿´´Ù. º´ÇÕÇÏ´Â °úÁ¤¿¡¼ ¸ÕÀú º´ÇÕ½Ãų kheapÀÇ Å©±â¿¡ ÇØ´çµÇ´Â nheapÀÇ ³ëµå p¸¦ ã¾Æ¼, nheapÀÇ root¿¡¼ ³ëµå pÀÌÀü(p-1¹ø°) ³ëµå¿¡ À̸£´Â °ÍµéÀÌ º´ÇÕµÈ ÈÄ¿¡µµ heap-ordered »óŸ¦ À¯Áö½ÃÅ°±â À§Çؼ kheap°ú ÀÌÁø°Ë»öÀ¸·Î¼ ¼öÇàµÈ´Ù. ±×¸®°í p¸¦ Áß½ÉÀ¸·ÎµÈ pheap°ú kheapÀ» ¼·Î º´ÇÕ½ÃÄѼ ±× Àüü°á°ú°¡ O((log(n/k)-k)*log(k)+log(p))½Ã°£¿¡ ¼öÇàµÈ´Ù. À̶§ kheapÀÇ Å©±â k´Â [log(size(nheap))]À¸·Î µÇ¾î ÀÖ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
This paper suggests an algorithm which is merged kheap with size k into nheap with size n. During the merging phase, we first find the node p, which is contained with the size k in kheap. And we perform the binary search with kheap¡¯s nodes and nheap¡¯s nodes which is the path from the root to p-1¡¯s. As a result, we always hold the merged heap with heap-ordered. This algorithm runs in O((log(n/k)-k)*log(k) log(p)) time. The size k in k-heap is restricted to [log(size(nheap))].
|
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|